1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
| #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define ll long long
#define maxn 1000001
using namespace std;
inline int read()
{
int l=0,w=1;
char ch=0;
while(ch<'0'||ch>'9')
{
if(ch=='-')
w=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
l=(l<<3)+(l<<1)+(ch^'0');
ch=getchar();
}
return w*l;
}
int n,m,fa[5001],k,ans;
struct pp
{
int fr,to,wi;
}Map[200001];
bool cmp(pp x,pp y)
{
return x.wi<y.wi;
}
int find(int x)
{
return x==fa[x]?x:fa[x]=find(fa[x]);
}
int main()
{
n=read(),m=read();
for(int i=0;i<=n;i++)
fa[i]=i;
for(int i=0;i<m;i++)
Map[i].fr=read(),Map[i].to=read(),Map[i].wi=read();
sort(Map,Map+m,cmp);
for(int i=0;i<m;i++)
{
if(find(Map[i].fr)!=find(Map[i].to))
{
k++,ans+=Map[i].wi;
fa[find(Map[i].fr)]=find(Map[i].to);
if(k==n-1)
{
printf("%d\n",ans);
return 0;
}
}
}
printf("orz\n");
return 0;
}
|
