1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
| #include<bits/stdc++.h>
using namespace std;
#define MAXN 200000+10
#define INF 0x3f3f3f
int f[MAXN];
struct point{
int u,v,s;
}a[MAXN];
int read(){
int f=1,x=0;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int find(int x){
if(f[x]==x)return f[x];
return f[x]=find(f[x]);
}
int link(int x,int y){
f[find(x)]=find(y);
}
bool cmp(point a,point b){
return a.s<b.s;
}
int main(){
int n=read(),m=read();
for(int i=1;i<=m;i++)
a[i].u=read(),a[i].v=read(),a[i].s=read();
sort(a+1,a+1+m,cmp);
for(int i=1;i<=m;i++)f[i]=i;
int ans=0,s=0,maxx=-INF;
for(int i=1;i<=m;i++){
if(find(a[i].u)!=find(a[i].v)){
link(a[i].u,a[i].v),ans+=a[i].s;
s++;
if(a[i].s>maxx)maxx=a[i].s;
if(s==n-1){
cout<<n-1<<" "<<maxx;
return 0;
}
}
}
return 0;
}
|
