BZOJ 1601 Usaco 灌水

#include <cstdio>
#include <algorithm>
using namespace std;
 
int n,x,Count;
int cost,fa[305];
int Min;
 
struct node{
    int u,v,w;
    bool operator <(const node &a)const{
        return w<a.w;
    }
}Edge[100005];
 
 
int getfa(int x){
    if(x!=fa[x]) return fa[x]=getfa(fa[x]);
    return fa[x];
}
 
 
void Run(){
    for(int i=1;i<=n+1;i++) fa[i]=i;
    std::sort(Edge+1,Edge+1+Count); 
    for(int i=1;i<=Count;i++){
        node &now = Edge[i];
        int fx = getfa(Edge[i].u);
        int fy = getfa(Edge[i].v);
        if(fx!=fy){
            //printf("Edge:%d %d %d Min:%d\n",now.u,now.v,now.w,Min);
            Min+=now.w;
            fa[fy]=fx;
        }
    }   
}
 
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        Count++;
        scanf("%d",&cost);
        Edge[Count].u=n+1;
        Edge[Count].v=i;
        Edge[Count].w=cost;
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++){
            Count++;
            scanf("%d",&x);
            Edge[Count].u=i;
            Edge[Count].v=j;
            Edge[Count].w=x;
    }
    Run();
    printf("%d\n",Min);
}