最小生成树(Kruskal)

#include<bits/stdc++.h>
using namespace std;
const int N = 600, M = 360000;
int n, k, xi[N], yi[N], tot;
int fa[N];

int find_fa(int x){
    if(x == fa[x])return x;
    return fa[x] = find_fa(fa[x]);
}
 
vector<int> res;
struct p{
    int x,y;
    double z;
}edge[M];

int cmp(p a,p b)
{
    return a.z < b.z;
}

double dis(int x0,int y0,int x1,int y1)
{
    return sqrt(1.0 * (x0 - x1) * (x0 - x1) + 1.0 * (y0 - y1) * (y0 - y1));
}

double Kruskal()
{
    double ans = 0;
    int cnt = n - k;
    sort(edge, edge + tot, cmp);
    /*printf("%d\n",tot);
    for(int i = 0; i < tot; i ++){
        printf("%d %d -- %.2lf\n", edge[i].x, edge[i].y, edge[i].z);
    }*/
    for(int i = 0, j = 0; i < tot ; i ++){
        int ta = find_fa(edge[i].x);
        int tb = find_fa(edge[i].y);
        if(cnt == j)break;
        if(ta != tb){
            fa[ta] = tb;
            ans = max(ans, edge[i].z);
            j ++;
        }
    }
    return ans;
}

int main()
{
    scanf("%d%d",&n, &k);
    for(int i = 0; i <= n; i ++)fa[i] = i;
    for(int i = 1; i <= n; i ++){
        scanf("%d%d",&xi[i], &yi[i]);
    }
    
    for(int i = 1; i <= n; i ++){
        for(int j = i + 1; j <= n; j ++){
            edge[tot].x = i;
            edge[tot].y = j;
            edge[tot++].z = dis(xi[i],yi[i],xi[j],yi[j]);
        }
    }
    /*printf("%d\n",tot);
    for(int i = 0; i < tot; i ++){
        printf("%d %d -- %.2lf\n", edge[i].x, edge[i].y, edge[i].z);
    }*/
    printf("%.2lf\n",Kruskal());
    return 0;
}