最小生成树--模板

 1 #include <cstdio>
 2 #include <iostream>
 3 #include <algorithm>
 4 using namespace std;
 5 int fa[10000];
 6 struct node
 7 {
 8     int st;
 9     int ed;
10     int w;
11 };
12 node a[200000];
13 bool cmp(node a,node b)
14 {
15     return a.w<b.w;
16 }
17 int find(int x)
18 {
19     if (fa[x]==x) return x;
20     else return fa[x]=find(fa[x]);
21 }
22 int update(int x,int y)
23 {
24     return fa[x] = y;
25 }
26 int main()
27 {
28     int n,m;
29     scanf ("%d%d",&n,&m);
30     for (int i = 1;i <= n;i++)
31         fa[i]=i;
32     for (int i = 1;i <= m;i++)
33     {
34         scanf ("%d%d%d",&a[i].st,&a[i].ed,&a[i].w);
35     }
36     int ans=0;
37     int tot=0;
38     sort(a+1,a+m+1,cmp);
39     for (int i = 1;i <= m;i++)
40     {
41         if (find(a[i].st)!=find(a[i].ed))
42         {
43             update(find(a[i].st),find(a[i].ed));
44             ans+=a[i].w;
45             tot++;
46         }
47     }
48     if (tot==n-1)
49     cout<<ans;
50     else 
51     cout<<"orz";
52     return 0;
53 }