ソースコード
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(int i=(n);i<(m);i++)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) for(int i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using PP=pair<ll,P>;
using vp=vector<P>;
using vpp=vector<PP>;
using vs=vector<string>;
#define fi first
#define se second
#define pb push_back
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
const ll MOD=1000000007LL;
const int INF=1<<30;
const ll LINF=1LL<<60;
int main(){
int n;
cin>>n;
vi vec(n);
REP(i,n){
cin>>vec[i];
}
vvi d(n,vi(n));
REP(i,n){
REP(j,n){
cin>>d[i][j];
}
}
vi dp(1<<n,INF);
dp[0]=0;
REP(i,1<<n){
REP(j,n){
if(i&(1<<j)){
continue;
}
int cost=vec[j];
REP(k,n){
if(i&(1<<k)){
cost-=d[k][j];
}
}
chmin(dp[i|(1<<j)],dp[i]+cost);
}
}
cout<<dp[(1<<n)-1]<<endl;
return 0;
}