题目:请戳此处
/*
ID:xz153531
LANG: C++
TASK: agrinet
*/
#include<stdio.h>
#include<stdlib.h>
int a[101][101],b[101],dj;
int main(){
freopen("agrinet.in","r",stdin);
freopen("agrinet.out","w",stdout);
int i,j,k,n,m,x,y,w,min,t;
scanf("%d",&n);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
scanf("%d",&a[i][j]);
b[1]=1; dj=0;
for (k=2;k<=n;k++){
min=200000;
for (i=1;i<=n;i++)
if (b[i]) for (j=1;j<=n;j++)
if ((b[j]==0) && (a[i][j]<min) && (a[i][j])){min=a[i][j]; t=j;}
b[t]=1; dj+=min;
}
printf("%d\n",dj);
return 0;
}