又是一裸题
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<iostream>
#include<algorithm>
#define T 200020
using namespace std;
int sc()
{
int i=0,f=1; char c=getchar();
while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9')i=i*10+c-'0',c=getchar();
return i*f;
}
struct E{int x,y,d;}e[T];
int n,m,fa[T],sum,ans;
bool cmp(E a,E b){return a.d>b.d;}
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
int main()
{
n=sc(),m=sc();
for(int i=1;i<=m;i++)
e[i].x=sc(),e[i].y=sc(),e[i].d=sc();
for(int i=1;i<=n;i++)
fa[i]=i;
sort(e+1,e+m+1,cmp);
for(int i=1;i<=m;i++)
{
int p=find(e[i].x),q=find(e[i].y);
if(p!=q)
{
fa[p]=q;
sum++;
ans+=e[i].d;
}
if(sum==n-1)break;
}
if(sum!=n-1)cout << -1;
else cout << ans;
return 0;
}