ソースコード
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
void Main() {
int n;
R n;
int c[n],a[n][n];
rep(i,n) R c[i];
rep(i,n)rep(j,n) R a[i][j];
int d[n][1<<n];
rep(i,n) {
rep(t,1<<n) {
d[i][t]=c[i];
rep(j,n) {
if(t&(1<<j)) d[i][t]-=a[j][i];
}
d[i][t]=max(d[i][t],0);
}
}
int dp[1<<n];
fill(dp,dp+(1<<n),MAX);
dp[0]=0;
rep(t,1<<n) {
rep(i,n) {
if(t&(1<<i)) continue;
dp[t|(1<<i)]=min(dp[t|(1<<i)],dp[t]+d[i][t]);
}
}
pr(dp[(1<<n)-1]);
}
int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}