旅行 （生成树模板）

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 500005, mod = 1e9 + 7;
typedef long long ll;

int f[N];
struct E
{
	int u, v, w;
}ed[N];

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

bool cmp(E& e1, E& e2)
{
	return e1.w > e2.w;
}

int main()
{
	std::ios::sync_with_stdio(0);
	cin.tie(0);

	int n, m;
	cin >> n >> m;

	for (int i = 1; i<= n; i++)
		f[i] = i;

	for (int i = 0; i < m; i++)
	{
		int u, v, w;
		cin >> u >> v >> w;
		ed[i] = { u,v,w };
	}

	sort(ed, ed + m,cmp );

	ll res = 0;
	for (int i = 0; i < m; i++)
	{
		int u = ed[i].u, v = ed[i].v;
		if(find(u)==find(v))
			continue;
		f[find(u)] = f[find(v)];
		res += ed[i].w;
	}

	cout << res;

	return 0;
}