一本通1487：【例 2】北极通讯网络

我是小蒟蒻

于 2024-03-02 23:33:51 发布

阅读量397

点赞数 11

文章标签：图论算法 c++

本文链接：https://blog.csdn.net/liu12345635/article/details/136424715

版权

//求最小生成树的第k长边 
#include<bits/stdc++.h>
using namespace std;
const int N = 250100;
int n,k,m,cnt;
double ans[N];
int pre[N],x[N],y[N];
struct EG{
	int from,to;
	double w;
	EG(){}
	EG(int from,int to,double w) : from(from),to(to),w(w){}
	bool operator < (const EG &b) const{
		return (w - b.w) < 1e-9;
	};
}e[N];
void read(){
	scanf("%d%d",&n,&k);
	for(int i = 1,a,b;i <= n;i++){
		scanf("%d%d",x+i,y+i);
		pre[i] = i;
	}
}
int find(int x){
	return x==pre[x]?x:pre[x]=find(pre[x]);
}
void un(int x,int y){
	int fx = find(x);
	int fy = find(y);
	if(fx != fy) pre[fx] = pre[fy];
}
double dis(int a,int b){
	return sqrt( (x[a]-x[b])*(x[a]-x[b]) + (y[a]-y[b]) * (y[a]-y[b]) );
}
void solve(){
	for(int i = 1; i <= n; i++){
		for(int j=1+i;j <= n; j ++){
			e[++m] = EG(i,j,dis(i,j));
		}
	}
	sort(e+1,e+m+1);
	for(int i=1;i <= m; i++){
		int fx = find(e[i].from),fy = find(e[i].to);
		if(fx==fy) continue;
		un(fx,fy);
		ans[++cnt] = e[i].w;
		//cout<<ans[cnt-1]<<endl;
		if(cnt == n) break;
	}
	printf("%.2f",ans[cnt-k+1]);
}
int main(){
	read();
	solve();
	return 0;
}