24/02/06总结

P2121 拆地毯

思路：我们只需要对最小生成树略微修改,把边权从大到小排序即可.

注意判断已经加入到同一个并查集中的数量为k.
ac:

	#include "iostream"
	#include "algorithm"
	using std::cin;
	using std::cout;
	using std::endl;
	using std::sort;
	int n, m, k;
	int a[100005];
	unsigned long long sum = 0;
	struct point {
		int u, v, w;
	}b[100005];

	bool cmp(point a, point b) {
		return a.w > b.w;
	}

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

	void Union(int t1, int t2) {
		a[find(t1)] = find(t2);
	}
	int main() {
		cin >> n >> m >> k;
		for (int i = 1; i <= n; i++)
			a[i] = i;
		for (int i = 1; i <= m; i++) {
			cin >> b[i].u >> b[i].v >> b[i].w;
		}
		sort(b + 1, b + 1 + m, cmp);
		for (int i = 1; i <= m; i++) {
			if (find(b[i].u) != find(b[i].v))
			{
				Union(b[i].u, b[i].v);
				sum += b[i].w;
				k--;
			}
			if (k == 0) {
				cout << sum;
				return 0;
			}
		}

	}