我们贪心的每次消灭最小边,用并查集维护有几个连通块,减到k个时就输出。
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1010
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,k,fa[N],num=0,ax[N],ay[N];
struct edge{
int u,v;double val;
}data[N*N];
inline void add(int u,int v,double val){
data[++num].u=u;data[num].v=v;data[num].val=val;
}
inline bool cmp(edge x,edge y){
return x.val<y.val;
}
inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
int main(){
// freopen("a.in","r",stdin);
n=read();k=read();
for(int i=1;i<=n;++i) ax[i]=read(),ay[i]=read();
for(int i=1;i<=n;++i)
for(int j=i+1;j<=n;++j)
add(i,j,sqrt((ax[i]-ax[j])*(ax[i]-ax[j])+(ay[i]-ay[j])*(ay[i]-ay[j])));
sort(data+1,data+num+1,cmp);
for(int i=1;i<=n;++i) fa[i]=i;
for(int i=1;i<=num;++i){
int xx=find(data[i].u),yy=find(data[i].v);
if(xx!=yy){
if(n>k) n--;
else{printf("%.2f\n",data[i].val);return 0;}
fa[xx]=yy;
}
}
}