1 int f[101], h;
 2 struct node{
 3     int x, y, l;
 4 } a[100001];
 5 inline bool cmp(node i, node j){
 6     return i.l < j.l;
 7 }
 8 inline int find(int x){
 9     if(x != f[x])//本身是否为父亲节点
10         f[x] = find(f[x]);
11     return f[x];
12 }//并查集操作
13 int main(){
14     for(int i = 1; i <= n; i++){
15         f[i] = i;
16     }//父节点初始化
17     sort(a+1, a+k+1, cmp);//排序
18     for(int i = 1; i <= k; i++){
19         int r1 = find(a[i].x);
20         int r2 = find(a[i].y);
21         if(r1 != r2){
22             f[r1] = r2;
23         }
24     }
25 }

#include<bits/stdc++.h>
using namespace std;
int n,m,a,b,c;
int sum;
int g[1001][1001],minn[1001];
bool u[1001];
int main(){memset(g,0x7f,sizeof(g));memset(minn,0x7f,sizeof(minn));memset(u,true,sizeof(u));cin>>n>>m;for(int i=1;i<=m;i++){cin>>a>>b>>c;g[a][b]=g[b][a]=c;sum+=c;}minn[1]=0;for(int i=1;i<=n;i++){int k=0;for(int j=1;j<=n;j++)if(u[j]&&minn[j]<minn[k])k=j;  u[k]=false;for(int j=1;j<=n;j++)if(u[j]&&g[k][j]<minn[j])minn[j]=g[k][j];}int total=0;for(int i=1;i<=n;i++) total+=minn[i];cout<<sum-total<<endl;return 0;
}

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<algorithm>
 4
 5 using namespace std;
 6
 7 int h, f[200005];
 8
 9 struct node{
10     int x, y, l;
11 } a[200005];
12
13 inline bool cmp(node i, node j){
14     return i.l < j.l;
15 }
16
17 inline int find(int x){
18     if(x != f[x])
19         f[x] = find(f[x]);
20     return f[x];
21 }
22
23 int main(){
24     int n, m;
25     scanf("%d%d", &n, &m);
26     for(int i = 1; i <= n; i++){
27         f[i] = i;
28     }
29     for(int i = 1; i <= m; i++){
30         scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].l);
31         //h += a[i].l;
32     }
33     sort(a+1, a+m+1, cmp);
34     for(int i = 1; i <= m; i++){
35         int r1 = find(a[i].x);
36         int r2 = find(a[i].y);
37         if(r1 != r2){
38             f[r1] = r2;
39             h += a[i].l;
40             //h -= a[i].l;
41         }
42     }
43     printf("%d", h);
44     return 0;
45 }

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<algorithm>
 4
 5 using namespace std;
 6
 7 int f[101], h;
 8
 9 struct node{
10     int x, y, l;
11 } a[100001];
12
13 inline bool cmp(node i, node j){
14     return i.l < j.l;
15 }
16
17 inline int find(int x){
18     if(x != f[x])
19         f[x] = find(f[x]);
20     return f[x];
21 }
22
23 int main(){
24     int n, k;
25     scanf("%d%d", &n, &k);
26     for(int i = 1; i <= n; i++){
27         f[i] = i;
28     }
29     for(int i = 1; i <= k; i++){
30         scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].l);
31         h += a[i].l;
32     }
33     sort(a+1, a+k+1, cmp);
34     for(int i = 1; i <= k; i++){
35         int r1 = find(a[i].x);
36         int r2 = find(a[i].y);
37         if(r1 != r2){
38             f[r1] = r2;
39             h -= a[i].l;
40         }
41     }
42     printf("%d", h);
43     return 0;
44 }