#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
struct edge{
int x,y,v;
}e[100010];
int n,p,cnt,ans,mn=99999999,a[10010],fa[10010];
int find(int x){if(fa[x]!=x)fa[x]=find(fa[x]);return fa[x];}
inline bool cmp(edge x,edge y){return x.v<y.v;}
int main(){
n=read();p=read();
for(int i=1;i<=n;i++){a[i]=read();fa[i]=i;mn=min(a[i],mn);}
for(int i=1;i<=p;i++){
int x=read(),y=read(),z=read();
e[i]=(edge){x,y,a[x]+a[y]+2*z};
}
sort(e+1,e+p+1,cmp);
for(int i=1;i<=p;i++){
int x=find(e[i].x),y=find(e[i].y);
if(x!=y){fa[x]=fa[y];ans+=e[i].v;if(++cnt==n)break;}
}
printf("%d",ans+mn);
return 0;
}
1232: [Usaco2008Nov]安慰奶牛cheer
最新推荐文章于 2017-10-04 23:02:24 发布