关押罪犯

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstring>
using namespace std;
typedef long long ll;
const int inf=1e9+7;
inline int read()
{
	int p=0,f=1;char c=getchar();
	while(c<'0'||c>'9') { if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') {p=p*10+c-'0';c=getchar();	}
	return f*p;
}
const int maxn=20009;
const int maxm=200019;
struct Edge{
	int next,to,w;
}p[maxm];
int n,m,fa[maxn],Enemy[maxn];
int find(int k)
{
	if(fa[k]==k) return k;
	else return fa[k]=find(fa[k]);
}
bool cmp(Edge x,Edge y)
{
	return x.w>y.w;
}
int main()
{
	n=read(),m=read();
	for(int i=1;i<=m;i++){
		p[i].next=read(),p[i].to=read(),p[i].w=read();
	}
	for(int i=1;i<=n;i++) fa[i]=i;
	sort(p+1,p+1+m,cmp);
	for(int i=1;i<=m;i++)
	{
		int t1=find(p[i].next),t2=find(p[i].to);
		if(t1==t2)
		{
			printf("%d",p[i].w);
			return 0;
		}
		if(!Enemy[p[i].next])
		 Enemy[p[i].next]=p[i].to;
		else fa[find(Enemy[p[i].next])]=find(p[i].to);
		if(!Enemy[p[i].to])
		 Enemy[p[i].to]=p[i].next;
		else fa[find(Enemy[p[i].to])]=find(p[i].next);
	}
	printf("0");
	return 0;
}