#include #include #include #include<stdio.h> #include #include<math.h> #include #include #include #include #include<string.h> #include #include #include #include #include #include #include<stdlib.h> #include #include<time.h> using namespace std; #define LL long long const int N=1e5+5; const int INF=0x3f3f3f3f; int n,m; int fa[11000]; struct node{ int x,y; int z; }p[6001000]; int find(int x){ if(xfa[x]){ return x; } return fa[x]=find(fa[x]); } bool cmp(node a,node b){ return a.z<b.z; } void init(){ for(int i=1;i<=n;i++){ fa[i]=i; } } void kruskal(){ int sum=0,ans=0; int xx,yy; for(int i=1;i<=m;i++){ xx=find(p[i].x); yy=find(p[i].y); if(xxyy){ continue; } fa[xx]=yy; sum=max(sum,p[i].z); ans++; } cout<<ans<<" "<<sum<<endl; } int main(){ /* freopen(".in","r",stdin); freopen(".out","w",stdout); */ cin>>n>>m; for(int i=1;i<=m;i++){ cin>>p[i].x>>p[i].y>>p[i].z; } init(); sort(p+1,p+1+m,cmp); kruskal(); return 0; }

1. • [ ] 1. -