PKU2349Prime低空飘过

原题 http://poj.org/problem?id=2349

//先将最小生成树的边放到一个数组里，然后排序。最后减去最大的那几个
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <limits.h>
#include <ctype.h>
#include <string.h>
#include <string>
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <deque>
#include <vector>
using namespace std;
#define INF 999999999.9
#define N 555
int X[N],Y[N];
double dis[N][N];
double g[N];
int vis[N];
int s,p;

double len(int x1,int y1,int x2,int y2){
	double c;
	c = sqrt((x1-x2+0.0)*(x1-x2+0.0)+(y1-y2+0.0)*(y1-y2+0.0));
	return c;
}

void Prime(){
	double sum[N];
	int mark = 2;
	int i,j;
	for(i=1;i<=p;i++){
		g[i] = dis[1][i];
	}
	vis[1] = 1;
	int k;
	double tmp;
	//double ans = -1111.12;
	int count = 0;
	for(i=1;i<=p;i++){
		tmp = INF;
		for(j=1;j<=p;j++){
			if(tmp>g[j] && vis[j]==0){
				tmp = g[j];
				k = j;
			}
		}
		if(tmp == INF){
			mark = 1;
			break;
		}
		else{
			vis[k] = 1;
			//if(tmp > ans){
			//	ans = tmp;
			//}
			sum[count] = tmp;
			count++;
			for(j=1;j<=p;j++){
				if(vis[j]==0 && dis[k][j]<g[j])
					g[j] = dis[k][j];
			}
		}
	}
	sort(sum,sum+count);
	//int ff = s/2;
	
	
	printf("%.2lf\n",sum[count-s]);
}

int main(){
	int i,j;
	int t;

	while(~scanf("%d",&t)){
		while(t--){
			memset(vis,0,sizeof(vis));
			memset(g,0,sizeof(g));
			scanf("%d%d",&s,&p);
			for(i=1;i<=p;i++){
				scanf("%d%d",&X[i],&Y[i]);
			}
			for(i=1;i<=p;i++){
				dis[i][i] = 0;
				for(j=1;j<=i;j++){
					dis[i][j] = len(X[i],Y[i],X[j],Y[j]);
					dis[j][i] = dis[i][j];
				}
			}
			/*int count;
			count = s/2;
			double max = -11111.1;
			int k;
			for(k=1;k<=count;k++){
				max = -11111.1;
				for(i=1;i<=p;i++){
					for(j=1;j<=i;j++){
						if(dis[i][j] > max){
							max = dis[i][j];
						}
					}
				}
				for(i=1;i<=p;i++){
					for(j=1;j<=i;j++){
						if(max == dis[i][j]){
							dis[i][j] = 0;
							dis[j][i] = 0;
						}
					}
				}
			}*/
			Prime();
		}
	}

	return 0;
}