最小连通成本

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

int main() {
vector<tuple<int,int,int>>edges{{2,0,1},{3,1,2},{7,0,2}};sort(edges.begin(),edges.end());vector<int>p{0,1,2};
function<int(int)>find=[&](int x){return p[x]==x?x:p[x]=find(p[x]);};int cost=0,used=0;
for(auto [w,u,v]:edges)if(find(u)!=find(v)){p[find(u)]=find(v);cost+=w;++used;}
cout<<cost<<" "<<used;
}

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

int main() {
vector<tuple<int,int,int>>edges{{2,0,1},{3,1,2},{7,0,2}};sort(edges.begin(),edges.end());vector<int>p{0,1,2};
function<int(int)>find=[&](int x){return p[x]==x?x:p[x]=find(p[x]);};int cost=0,used=0;
for(auto [w,u,v]:edges)if(find(u)!=find(v)){p[find(u)]=find(v);cost+=w;++used;}
cout<<cost<<" "<<used;
}