HDU 1875 最小生成树--距离变形

原题

The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost will have a radio transceiver and some outposts will in addition have a satellite channel.
Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed D, which depends of the power of the transceivers. Higher power yields higher D but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of D is the same for every pair of outposts.

Your job is to determine the minimum D required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts.
Input
The first line of input contains N, the number of test cases. The first line of each test case contains 1 <= S <= 100, the number of satellite channels, and S < P <= 500, the number of outposts. P lines follow, giving the (x,y) coordinates of each outpost in km (coordinates are integers between 0 and 10,000).
Output
For each case, output should consist of a single line giving the minimum D required to connect the network. Output should be specified to 2 decimal points.

题目大意

有P个点，S次外挂，每开一次外挂，就可以把2个点连起来，
接下来P行，告诉你每个点的坐标，（我最讨厌算距离了，double很容易错…）
求这S个点组成的图中最小生成树的最大权值D（外挂的除外）。

分析

既然要使D尽可能小，那么贪心一下，可知外挂开得越大，D就越小。所以我们采用Kruskal算法，在最后的S条边上用外挂。
话不多说，上代码：

double ans;
	int t,m,cnt;
	scanf("%d",&t);//多组数据
	while(t--){
   
		scanf("%d%d",&m,&n);
		m=n-m;//这里方便起见，我换成了有m次不能用外挂
		//其实这里应该是m=n-1-m+1;的
		ans=0;cnt=0;
		for(int i=1;i<=n;i++)
			cin>>x[i]>>y[i];
		for(int i=1;i<=n;i++){
   
			for(int j=i+1;j<=n;j++){
   
				double dis=sqrt((x[i