You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
35 lines
1018 B
C++
35 lines
1018 B
C++
#include <algorithm>
|
|
#include <cmath>
|
|
#include <cstdio>
|
|
#include <cstring>
|
|
using namespace std;
|
|
int n, k, fa[1010], X[1010], Y[1010], cnt, ecnt;
|
|
double ans;
|
|
int Find(int x) { return fa[x] == -1 ? x : fa[x] = Find(fa[x]); }
|
|
struct edge
|
|
{
|
|
int u, v;
|
|
double l;
|
|
bool operator<(const edge &rhs) const { return l < rhs.l; }
|
|
}edges[1000010];
|
|
int main()
|
|
{
|
|
memset(fa, -1, sizeof(fa));
|
|
scanf("%d%d", &n, &k);
|
|
for (int i = 1; i <= n; i++) scanf("%d%d", X + i, Y + i);
|
|
for (int i = 1; i <= n; i++)
|
|
for (int j = 1; j < i; j++, ecnt++)
|
|
edges[ecnt].u = i, edges[ecnt].v = j,
|
|
edges[ecnt].l = sqrt((X[i] - X[j]) * (X[i] - X[j]) +
|
|
(Y[i] - Y[j]) * (Y[i] - Y[j]));
|
|
sort(edges, edges + ecnt);
|
|
for (int i = 0, fx, fy; i < ecnt; i++)
|
|
if ((fx = Find(edges[i].u)) != (fy = Find(edges[i].v)))
|
|
{
|
|
fa[fx] = fy;
|
|
cnt++, ans = edges[i].l;
|
|
if (cnt - 1 == n - k) break;
|
|
}
|
|
printf("%.2lf", ans);
|
|
return 0;
|
|
} |