constructing roads

C - Constructing Roads

There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.
We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
input
The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j.
Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
output
You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.
Sample Input
3
0 990 692
990 0 179
692 179 0
1
1 2
Sample Output
179
题意：给出n个点两两之间的权值，然后m对a，b，表示a,b之间连通
输出这n个点连通的最小权值和是多少。
分析：对已经连通的点使用并查集方法，再写主函数时，注意对输入时的一个处理，利用结构体进行标记。

#include"iostream"
#include"set"
#include"algorithm"
using namespace std;
int pre[1005];
void init()
{
	for(int i = 0;i <= 1000;i ++)
	{
		pre[i]=i;
	}
}
int find(int x)
{
	return x == pre[x] ? x:pre[x]=find(pre[x]);
}
int pjoin(int x,int y)
{
	int fx=find(x);
	int fy=find(y);
	if(fx != fy)
	{
		pre[fx]=fy;
		return 1;
	}
	return 0;
}
void djoin(int x,int y)
{
	int fx=find(x);
	int fy=find(y);
	if(fx != fy)
	{
		pre[fx]=fy;
	}
}
struct Point
{
	int x,y;
	int u;
};
int cmp (Point a,Point b)
{
	return a.u<b.u;
}
int main()
{
	Point p[10000];
	int n;
	while(cin >> n)
	{
		init();
		int l=0;
		for(int i = 0;i < n;i ++)
		{
			for(int j = 0;j < n;j ++)
			{
				int X;
				cin>>X;
				if( i == j)
				{
					continue;
				}
				p[l].x=i;
				p[l].y=j;
				p[l].u=X;
				l++;
			}
		}
		int b;
		cin >> b;
		while(b--)
		{
			int X,Y;
			cin >> X  >> Y;
			X--;
			Y--;
			djoin(X,Y);
		}
		sort(p,p+l,cmp);
	         int sum=0,f=0;
		for(int i = 0;i < l;i ++)
		{
			if(pjoin(p[i].x,p[i].y))
			{
				sum+=p[i].u;
				f++;
			}
		}
		cout << sum <<endl;
	}
	return 0;
}