poj 1258

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int M=105, inf=100010;
int a[M][M], dis[M*M], vis[M], n, ans;

bool prim()
{
    int i,j,k,tmp;
    memset(vis,0,sizeof(vis));
    for(i=1; i<=n; i++)
        dis[i]=inf;
    ans=dis[1]=0;
    for(i=1;i<=n;i++)
    {
        tmp=inf, k=0;
        for(j=1;j<=n;j++)
            if( vis[j]==0 && dis[j]<tmp )
            {
                tmp=dis[j];
                k=j;
            }
        if( tmp==inf ) return false;
        vis[k]=true;
        ans+=tmp;
        for(j=1;j<=n;j++)
            if( vis[j]==0 && dis[j]>a[k][j]) dis[j]=a[k][j];
    }
    return true;
}

int main()
{
    // freopen("in","r",stdin);
    // freopen("out","w",stdout);
    int i,j;
    while(~scanf("%d",&n))
    {
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                scanf("%d",&a[i][j]);
        prim();
        printf("%d\n",ans);
    }
    return 0;
}