fork download
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<stack>
  14. #include<set>
  15. #include<map>
  16. using namespace std;
  17. //Macro
  18. #define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
  19. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  20. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  21. #define irep(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  22. #define read() (strtol(ipos,&ipos,10))
  23. #define sqr(x) ((x)*(x))
  24. #define pb push_back
  25. #define PS system("pause");
  26. typedef long long ll;
  27. typedef pair<int,int> pii;
  28. const int oo=~0U>>1;
  29. const double inf=1e100;
  30. const double eps=1e-6;
  31. string name="", in=".in", out=".out";
  32. //Var
  33. struct UNION
  34. {
  35. int f[308];
  36. UNION(){rep(i,1,300)f[i]=i;}
  37. int Find(int x){return f[x]==x?f[x]:f[x]=Find(f[x]);}
  38. void Union(int x,int y){f[x]=y;}
  39. }U;
  40. struct E
  41. {
  42. int a,b,c;
  43. bool operator<(const E &o)const{return c<o.c;}
  44. }e[100000];
  45. int n,m,ans;
  46. void Work()
  47. {
  48. int x,y;
  49. scanf("%d%d",&n,&m);
  50. rep(i,1,m)scanf("%d%d%d",&e[i].a,&e[i].b,&e[i].c);
  51. sort(e+1,e+1+m);
  52. rep(i,1,m)
  53. {
  54. x=U.Find(e[i].a);y=U.Find(e[i].b);
  55. if(x!=y)ans=e[i].c,U.Union(x,y);
  56. }
  57. printf("%d %d\n",n-1,ans);
  58. }
  59. int main()
  60. {
  61. // freopen((name+in).c_str(),"r",stdin);
  62. // freopen((name+out).c_str(),"w",stdout);
  63. // Init();
  64. Work();
  65. return 0;
  66. }
Not running #stdin #stdout 0s 0KB
stdin
Standard input is empty
stdout
Standard output is empty