hdu_1102 Constructing Roads

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
#define N 10005
int Father[N];
struct node
{
    int u,v,w;
};
node vertex[N];

bool cmp(node a,node b)
{
    return a.w < b.w;
}
void Make_set(int n)
{
    int i;
    for(i=0 ; i<=n; i++)
        Father[i] = i;
}

int Find_set(int x)
{
    int ans,temp,pre;
    pre = x;
    while(x != Father[x])
    {
        x = Father[x];
    }
    ans = x;
    while(pre != Father[pre])
    {
        temp = Father[pre];
        Father[pre] = ans;
        pre = temp;
    }
    return ans;
}
void Union_set(int a,int b)
{
    int x = Find_set(a);
    int y = Find_set(b);
    Father[x] = y;
}

int main()
{
    int save[105][105];
    int n,m,i,j,k,a,b,x,y,ans;
    while(cin>>n)
    {
        k=0,ans=0;
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                cin>>save[i][j];
        for(i=1; i<=n; i++)
            for(j=i+1; j<=n; j++)
            {
                vertex[k].u = i;
                vertex[k].v = j;
                vertex[k++].w = save[i][j];
            }
        sort(vertex,vertex+k,cmp);
        Make_set(n);
        cin>>m;
        for(i=0; i<m; i++)
        {
            cin>>a>>b;
            Union_set(a,b);
        }
        for(i=0; i<k; i++)
        {
            x = Find_set(vertex[i].u);
            y = Find_set(vertex[i].v);
            if(x != y)
            {
                Union_set(vertex[i].u,vertex[i].v);
                ans += vertex[i].w;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}