ソースコード
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<iomanip>
#include<set>
#include<numeric>
#include<sstream>
#include<random>
#include<cassert>
#include<list>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {1, 1, 0, -1, -1, 0};
int dx[] = {1, 0, -1, -1, 0, 1};
#define ceil(a, b) a / b + !!(a % b)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int main() {
int n;
cin >> n;
int t[n];
rep(i, n) cin >> t[i];
int a[n][n];
rep(i, n) rep(j, n) cin >> a[i][j];
int dp[1 << n];
rep(i, (1 << n)) dp[i] = inf;
dp[0] = 0;
rep(i, (1 << n)) {
rep(j, n) {
if (!(i & (1 << j))) { //which to add
int cost = t[j];
rep(k, n) {
if (i & (1 << k)) {
cost -= a[j][k];
}
}
chmin(dp[i | 1 << j], dp[i] + cost);
}
}
}
cout << dp[(1 << n) - 1] << endl;
}