zoj1914prim

//zoj1914prim求出最小生成树，输出第S大的边的权值//原来prim需要把图先初始化为足够大的，又学习了一点#include "stdio.h"#include #include #define maxint 505#define INT_MAX 99999999long c[505][505];long coord[505][2];int cases,S,P;void input(){int i,j;scanf("%d%d",&S,&P);for(i=1;i<=P;i++)scanf("%d%d",&coord[i][0],&coord[i][1]);for(i=1;i<=P;i++)for(j=1;j<=P;j++){c[i][j]=INT_MAX;}for(i=1;i<=P;i++)for(j=1;j<=P;j++){c[i][j]=(coord[i][0]-coord[j][0])*(coord[i][0]-coord[j][0])+(coord[i][1]-coord[j][1])*(coord[i][1]-coord[j][1]);}}int cmp(const void *a,const void *b){double *a1,*b1;a1=(double*)a;b1=(double*)b;if( *a1>*b1)return 1;else return -1;}void Prim( ){int lowcost[maxint]; int s[maxint];int count=0;double tree[maxint];s[1]=1;int i,j,k;for(i=2;i<=P;i++){lowcost[i]=c[1][i];s[i]=0;}for(i=1;i<=P;i++){int min=INT_MAX/5;j=1;for(k=2;k<=P;k++)if(lowcost[k]<min&&!s[k]){min=lowcost[k];j=k;}tree[count++]=min;s[j]=1;for(k=2;k<=P;k++)if(c[j][k]<lowcost[k]&&!s[k]){lowcost[k]=c[j][k];}}qsort(tree,count,sizeof(double),cmp);printf("%.2lf\n",sqrt(tree[P-1-S]));}int main (){scanf("%d",&cases);while(cases--){input();Prim();}return 0;}