Problem: Example

Input

4 4
1 2 3
1 3 3
2 3 3
2 4 3


Output

1 3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF 1e16
#define mod 1000000007

struct UnionFind{
  vector<int> v;
  UnionFind(int n) : v(n, -1) {}
  void init(){ for(int i = 0;i < v.size();i++)v[i]=-1; }
  int find(int x) { return v[x] < 0 ? x : v[x] = find(v[x]); }
  bool unite(int x, int y) {
    x = find(x); y = find(y);
    if (x == y) return false;
    if (-v[x] < -v[y]) swap(x, y);
    v[x] += v[y]; v[y] = x;
    return true;
  }
  bool root(int x) { return v[x] < 0; }
  bool same(int x, int y) { return find(x) == find(y); }
  int size(int x) { return -v[find(x)]; }
};

struct edge{
  int u,v,w;
};
bool operator<(const edge& a,const edge& b){
  return a.w < b.w;
}

int main(){
  int n,m;
  cin>>n>>m;
  UnionFind uf(n);
  vector<edge> es;
  int tot=0;
  rep(i,m){
    int a,b,c;
    cin>>a>>b>>c;
    a--;b--;
    es.push_back((edge){a,b,c});
  }
  sort(all(es));
  vector<int> used;
  rep(i,m){
    if(uf.same(es[i].u,es[i].v))continue;
    uf.unite(es[i].u,es[i].v);
    tot+=es[i].w;
    used.push_back(i);
  }
  int resa=0,resb=0;
  rep(k,used.size()){
    uf.init();
    int sum=0;
    rep(i,m){
      if(uf.same(es[i].u,es[i].v)||i==used[k])continue;
      uf.unite(es[i].u,es[i].v);
      sum+=es[i].w;
    }
    if(tot<sum||uf.size(0)<n){
      resa++;
      resb+=es[used[k]].w;
    }
  }
  cout<<resa<<" "<<resb<<endl;
  return 0;
}