POJ 2349 Arctic Network G++ kruskal实现 prim未实现

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
using namespace std;
//英语  看博友分析 最小生成树 prim未实现  kruskal实现 
double x[508];
double y[508]; 
int fa[508];
int find(int x)
{
	if(fa[x]==-1)
	{
		return x;
	}else
	{
		return fa[x]=find(fa[x]);
	}
}
struct nod{
	int x;
	int y;
	double zhi;
};
bool cmp(nod a,nod b)
{
	return a.zhi<b.zhi;
}
int main()
{
	int T;
	cin>>T;
	for(int o=0;o<T;o++)
	{
		vector<nod> ve;
		ve.clear();
		memset(fa,-1,sizeof(fa));
		int s,p;
		cin>>s>>p;
		for(int i=0;i<p;i++)
		{
			cin>>x[i]>>y[i];
		}
		
		for(int i=0;i<p;i++)
		{
			for(int j=0;j<i;j++)//抄博友 
			{
				ve.push_back((nod){i,j,sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]))});
				//cout<<i<<" "<<j<<" "<<sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]))<<endl;
			}
		}
		//cout<<endl;
		sort(ve.begin(),ve.end(),cmp);
		vector<double> jg;
		jg.clear();
		for(int i=0;i<ve.size();i++)
		{
			int tx=ve[i].x;
			int ty=ve[i].y;
			double tz=ve[i].zhi;
			if(find(tx)!=find(ty))
			{
				fa[find(tx)]=find(ty);
				jg.push_back(tz);
				//cout<<tx<<" "<<ty<<" "<<tz<<endl;
			}
		}
		//cout<<fixed<<setprecision(2)<<jg[p-s-1]<<endl;//抄博友程序 
		sort(jg.begin(),jg.end(),greater<double>());
		/* 
		for(int i=0;i<jg.size();i++)
		{
			cout<<jg[i]<<endl;
		}*/		
		cout<<fixed<<setprecision(2)<<jg[s-1]<<endl;//任何带卫星频道的两个前哨都可以通过卫星进行通信
	}	
	return 0;
}