Destroy Walls HDU - 6187

最小生成树

算法导论对最小生成树的讲解好难，慢慢啃吧

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<vector>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
const int N = 2e5;
struct edge
{
	int u, v, w;
};
edge e[N + 5];
int p[N + 5];
int f(int k) 
{ 
	return p[k] == k ? k : p[k] = f(p[k]);
}
bool cmp(const edge& a, const edge& b) { return a.w > b.w; }
int main()
{
	int sum, ans, cnt, n, m, x, y;
	while (scanf("%d%d", &n, &m) == 2)
	{
		cnt = ans = sum = 0;
		for (int i = 1; i <= n; i++) scanf("%d%d", &x, &y), p[i] = i;
		for (int i = 0; i < m; i++)scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].w), sum += e[i].w;
		sort(e, e + m, cmp);
		for (int i = 0; i < m; i++)
		{
			int fu = f(e[i].u), fv = f(e[i].v);
			if (fu != fv)
			{
				cnt++;
				p[fu] = fv;
				ans += e[i].w;
			}
		}
		printf("%d %d\n", m - cnt, sum - ans);
	}
	system("pause");
}