1160. Network（最小生成树）

１１６０

算是模版了　没什么限制　结束输出就行了

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<vector>
 #include<stdlib.h>
 using namespace std;
 #define N 1010
 #define M 15010
 struct node
 {
     int x,y,len;
 }p[M];
 int fa[N];
 int find(int x)
 {
     if(fa[x]!=x)
     fa[x] = find(fa[x]);
     return fa[x];
 }
 bool cmp(node a,node b)
 {
     return a.len<b.len;
 }
 int main()
 {
     int i,j,n,m;
     scanf("%d%d",&n,&m);
     for(i =; i <= n ; i++)
     fa[i] = i;
     for(i =  ; i <= m ; i++)
     {
         scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].len);
     }
     sort(p+,p+m+,cmp);
     int s = ,maxz=;
     for(i = ; i <= m&&s<n- ;  i++)
     {
         int tx = find(p[i].x),ty = find(p[i].y);
         if(tx!=ty)
         {
             fa[tx] = ty;
             s++;
             maxz = max(maxz,p[i].len);
         }
     }
     printf("%d\n",maxz);
     printf("%d\n",i-);
     for(j = ; j < i ; j++)
     printf("%d %d\n",p[j].x,p[j].y);
     return ;
 }