10分求助

#include<bits/stdc++.h>
using namespace std;
#define int long long
int f[2000005],  n, len, cnt, ans;
struct xxxxx {
	int e, w, v;
}b[4000005];
bool cmp(xxxxx x, xxxxx y) {
	return x.v > y.v;
}
int find(int x) {
	if(f[x] == x) return x;
	return find(f[x]);
}
signed main() { 
	for(int i = 0;i < 2000005;i ++) {
		f[i] = i;
	}
	cin >> n;
	for(int i = 1;i <= n;i ++) {
		int w;
		cin >> w;
		b[++ len].v = w;
		b[len].e = i;
		b[len].w = n + 1;
	}
	for(int i = 1;i <= n;i ++) {
		for(int j = 1;j <= n - 1;j++) {
			int x;
			cin >> x;
			b[++ len].v = x;
			b[len].e = i;
			b[len].w = j;
		}
	}
	sort(b + 1, b + len + 1, cmp);
	for(int i = 1;i <= len;i ++) {
		int x = find(b[i].e), y = find(b[i].w);
		if(x != y) {
			f[x] = y;
			ans += b[i].v;
			cnt ++;
			if(cnt == n - 2) {
				break;
			}
		}
	}
	cout << ans;
}