能过案例，按照板子写的，求调

#include <bits/stdc++.h> 
using namespace std;

const int N = 200005;

struct Edge{
	int a, b, c;
	bool operator<(const Edge &C)const {
		return c < C.c;
	}
}edge[N];

int f[1000];

int n, m, cnt, num, k;

int find(int x) {
	if (x != f[x]) f[x] = find(f[x]);
	return f[x];
}

int kruskal() {
	for (int i = 1; i <= m; i++) f[i] = i;
	sort(edge + 1, edge + cnt + 1);
	int res = 0;
	for (int i = 1; i <= cnt - num; i++) {
		int fa = find(edge[i].a), fb = find(edge[i].b);
		int c = find(edge[i].c);
		if (fa != fb) {
			f[fa] = fb;
			res += c;
			k++;
		}
	}
	return res;
}

int main() {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= m; j++) {
			int c;
			cin >> c;
			if (i >= j || c == 0) continue;
			edge[++cnt] = {i, j, c};
			if (edge[i].c > n) num++;
		}
	}
	int t = kruskal();
	if (k == m - 1) cout << t + n;
	else printf("%d", t + (m - k) * n);
	return 0;
}