1095F - Make It Connected(贪心+MST)

https://codeforces.com/problemset/problem/1095/F

---

思路：若没有提供的边时，怎么建图最小：我们把点权值由小到大排序，然后后面的依次连最小的。

有边那就连进去建新图，于是最多m+n-1条边。mst直接可做了。

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
struct Edge{
   LL u,v,cost;
}edges[maxn*2];
struct P{
   LL val,id;
}a[maxn];
bool cmp(P A,P B){
    return A.val<B.val;
}
bool cmp2(Edge A,Edge B){
    return A.cost<B.cost;
}
LL fa[maxn],tot=0;
LL find(LL x){
   if(fa[x]!=x) return fa[x]=find(fa[x]);
   return fa[x];
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,m;cin>>n>>m;
   for(LL i=1;i<=n+10;i++) fa[i]=i;
   for(LL i=1;i<=n;i++) cin>>a[i].val,a[i].id=i;
   for(LL i=1;i<=m;i++){
       LL u,v,cost;cin>>u>>v>>cost;
       edges[++tot].u=u;edges[tot].v=v;edges[tot].cost=cost;
   }
   sort(a+1,a+1+n,cmp);
   for(LL i=2;i<=n;i++){
      edges[++tot].u=a[1].id;edges[tot].v=a[i].id;edges[tot].cost=a[1].val+a[i].val;
   }
   sort(edges+1,edges+1+tot,cmp2);
   LL ans=0;
   for(LL i=1;i<=tot;i++){
      LL u=edges[i].u;LL v=edges[i].v;LL cost=edges[i].cost;
      if(find(u)!=find(v)){
         fa[find(u)]=find(v);
         ans+=cost;
      }
   }
   cout<<ans<<"\n";
   return 0;
}