题目链接:P1195 口袋的天空
程序说明:
题意是n个顶点构造k个树,则需要连n - k条边。(不要错误理解为选k个点构造最小生成树,连k - 1条边)
代码如下:
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1010, M = 10010;
int n, m, k, p[N];
struct Edge {
int a, b, w;
bool operator < (const Edge &W) const {
return w < W.w;
}
} edge[M];
int find(int x) {
if(p[x] != x) p[x] = find(p[x]);
return p[x];
}
int kruskal() {
for(int i = 1; i <= n; i++) p[i] = i;
sort(edge, edge + m);
int res = 0, cnt = 0;
for(int i = 0; i < m; i++) {
int a = edge[i].a, b = edge[i].b, w = edge[i].w;
a = find(a), b = find(b);
if(a != b) {
p[a] = b;
res += w;
cnt++;
}
if(cnt == n - k) {
return res;
}
}
return -1;
}
int main() {
cin>>n>>m>>k;
for(int i = 0; i < m; i++) {
int x, y, z;
cin>>x>>y>>z;
edge[i] = {x, y, z};
}
int t = kruskal();
if(t == -1) cout<<"No Answer"<<endl;
else cout<<t<<endl;
return 0;
}