https://www.acwing.com/problem/content/1148/
#include<bits/stdc++.h>
using namespace std;
struct node{int a,b,c;};
bool cmp(node a,node b) {return a.c<b.c;}
const int N=1e3+10;
int a[N],p[N],n,c;
vector<node>ve;
int find(int x)
{
if(x!=p[x]) p[x]=find(p[x]);
return p[x];
}
int f()
{
int res=0;
for(int i=0;i<=n;i++) p[i]=i;
sort(ve.begin(),ve.end(),cmp);
for(int i=0;i<ve.size();i++)
{
int a=ve[i].a,b=ve[i].b,c=ve[i].c;
if(find(a)!=find(b))
{
p[find(a)]=find(b);
res+=c;
}
}
return res;
}
int main(void)
{
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],ve.push_back({0,i,a[i]});
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
cin>>c;
if(c) ve.push_back({i,j,c});
}
cout<<f()<<endl;
return 0;
}