ソースコード
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
int main() {
int n;
cin >> n;
int ans = 0;
REP(i,n) ans += in();
VVI a(n, VI(n));
REP(i,n) REP(j,n) a[i][j] = in();
VI dp(1 << n, -1e9);
dp[0] = 0;
REP(mask,1<<n){
REP(i,n){
if ((mask >> i) & 1) continue;
int s = dp[mask];
REP(j,n) if ((mask >> j) & 1) s += a[j][i];
int mask_next = mask | (1 << i);
dp[mask_next] = max(dp[mask_next], s);
}
}
ans -= dp[(1 << n) - 1];
cout << ans << endl;
return 0;
}