P4047 [JSOI2010]部落划分(kruskal)

P4047 [JSOI2010]部落划分https://www.luogu.com.cn/problem/P4047

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, k;
double x[MAXN];
double y[MAXN];
struct node {
	int l, r;
	double cost;
};
node edge[MAXN];
int pre[MAXN];

bool cmp(node a, node b) {
	return a.cost < b.cost;
}

inline void init() {
	for (int i = 1; i <= n; i++) {
		pre[i] = i;
	}
}

int find(int x) {
	if (x == pre[x])
		return x;
	return pre[x] = find(pre[x]);
}

inline void unite(int x, int y) {
	x = find(x);
	y = find(y);
	pre[x] = y;
}

inline bool same(int x, int y) {
	return find(x) == find(y);
}

int main() {
	scanf("%d %d", &n, &k);
	init();
	for (int i = 1; i <= n; i++) {
		scanf("%lf %lf", x + i, y + i);
	}
	int cnt = 0;
	for (int i = 1; i < n; i++) {
		for (int j = i + 1; j <= n; j++) {
			double c = sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));
			edge[++cnt] = node{i, j, c};
		}
	}
	//printf("%d", cnt);
	//printf("%lf\n", edge[3].cost);
	sort(edge + 1, edge + cnt + 1, cmp);
	int now = 0;
	bool flag = false;
	for (int i = 1; i <= cnt; i++) {
		//printf("%d %.2lf\n", now, edge[i].cost);
		if (now == n - k)
			flag = true;

		if (!same(edge[i].l, edge[i].r)) {
			unite(edge[i].l, edge[i].r);
			now++;
			//	printf("%d %d %.2lf\n", edge[i].l, edge[i].r, edge[i].cost);
		} else
			continue;
		if (flag) {
			printf("%.2lf", edge[i].cost);
			return 0;
		}
	}
	return 0;
}