CCF-CSP真题题解：201412-4 最优灌溉

201412-4 最优灌溉

最小生成树

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 1e5 + 10;

int n, m;
struct Edge {
	int a, b, c;
	
	bool operator<(const Edge & t) const {
		return c < t.c;
	}
} e[N];
int p[N];

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

int main() {
	scanf("%d%d", &n, &m);
	
	for (int i = 1; i <= n; i++) p[i] = i;
	
	for (int i = 0; i < m; i++) {
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		e[i] = {a, b, c};
	}
	sort(e, e + m);
	
	int res = 0;
	for (int i = 0; i < m; i++) {
		int a = e[i].a, b = e[i].b, c = e[i].c;
		if (find(a) != find(b)) {
			res += c;
			p[find(a)] = find(b);
		}
	}
	
	printf("%d\n", res);
	
	return 0;
}