HDU 6187 Destroy Walls (对偶图最小生成树)

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int maxm = 200010;
struct edge{
    int u,v,w;
    edge(){}
    bool operator<(const edge &rhs) const{
        return w > rhs.w;
    }
}edge[maxm];
int V,E;
namespace DSU{
    int fa[maxn];
    void init(){
        for(int i=1; i<maxn; i++) fa[i] = i;
    }
    int find_set(int x){
        if(x==fa[x]) return x;
        else return fa[x] = find_set(fa[x]);
    }
    bool union_set(int x, int y){
        x = find_set(x);
        y = find_set(y);
        if(x!=y){
            fa[x] = y;
            return 1;
        }
        return 0;
    }
}
using namespace DSU;
int main()
{
    while(~scanf("%d %d", &V,&E))
    {
        init();
        for(int i=0; i<V; i++){
            int x,y;
            scanf("%d %d", &x,&y);
        }
        long long ans = 0;
        for(int i=0; i<E; i++){
            scanf("%d %d %d", &edge[i].u, &edge[i].v, &edge[i].w);
            ans += edge[i].w;
        }
        sort(edge, edge+E);
        int cnt = 0;
        for(int i=0; i<E; i++){
            if(union_set(edge[i].u, edge[i].v)){
                ans -= edge[i].w;
                ++cnt;
            }
        }
        printf("%d %lld\n", E-cnt, ans);
    }
    return 0;
}