```cpp
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<vector>
#include<map>
#define int long long
#define N 2000005
#define M 1000005
using namespace std;
int n,m,cnt,ans;
int fa[N];
struct kru
{
int from;
int to;
int val;
}e[M];
int re()
{
int x=0,p=1;
char y=getchar();
for(;y>'9'||y<'0';y=getchar())
if(y=='-')
p=-p;
for(;y>='0'&&y<='9';y=getchar())
x=x*10+y-'0';
return x*p;
}
void wr(int x)
{
if(x<0)
{
putchar('-');
x=-x;
}
if(x>9)
wr(x/10);
putchar(x%10+'0');
}
int find(int x)
{
if(fa[x]==x)
return x;
return fa[x]=find(fa[x]);
}
bool cmp(kru a,kru b)
{
return a.val<b.val;
}
signed main()
{
n=re(),m=re();
for(int i=1;i<=n;i++)
fa[i]=i;
for(int i=1;i<=m;i++)
e[i].from=re(),e[i].to=re(),e[i].val=re();
sort(e+1,e+1+m,cmp);
for(int i=1;i<=m;i++)
{
int f1=find(e[i].from),f2=find(e[i].to);
if(f1==f2)
continue;
cnt++,ans=max(ans,e[i].val);
if(cnt==n-1)
break;
}
wr(ans);
return 0;
}
```
by _mi_ka_ @ 2022-08-18 14:31:08
@[yuezongbo](/user/664103) 没有合并。
by 喵仔牛奶 @ 2022-08-18 14:56:27
```cpp
fa[f2]=f1,cnt++,ans=max(ans,e[i].val);
```
by 喵仔牛奶 @ 2022-08-18 14:56:53
@[喵仔牛奶](/user/560516) 谢谢dalao，以AC。
by _mi_ka_ @ 2022-08-18 15:05:53
666
by Derrick_Rose @ 2023-08-13 11:12:31