版权声明：听说这里让写版权声明～～～ https://blog.csdn.net/m0_37691414/article/details/82083303
求最小生成树的权值和.
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 110;
int e[N][N], dis[N];
bool visit[N];
int n;
int main(){
while(~scanf("%d", &n)){
fill(e[0], e[0] + N*N, INF);
fill(dis, dis + N, INF);
memset(visit, false, sizeof(visit));
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
scanf("%d", &e[i][j]);
dis[1] = 0;
int sum = 0;
for(int i = 0; i < n; ++i){
int u = -1, minn = INF;
for(int j = 1; j <= n; ++j)
if(visit[j] == false && dis[j] < minn){
minn = dis[j];
u = j;
}
if(u == -1) break;
visit[u] = true;
sum += minn;
for(int v = 1; v <= n; ++v)
if(visit[v] == false && dis[v] > e[u][v])
dis[v] = e[u][v];
}
printf("%d\n", sum);
}
return 0;
}