ソースコード
/**
*
*/
#include <iostream>
#include <vector>
#include <cstdint>
using namespace std;
constexpr long long INF = 1'010'000'000'000'000'017LL;
#define FOR(i, start, end) for(long long i = (start); i < (end); ++i)
#define REP(i, n) FOR(i, 0, n)
//--------------------------------------------------------------------
void solve() {
long long N; cin >> N;
vector<long long> T(N);
REP(i, N) { cin >> T[i]; }
vector<vector<long long>> M(N, vector<long long>(N));
REP(i, N) REP(j, N) {
cin >> M[i][j];
}
vector<long long> dp(1LL<<N, INF);
dp[0] = 0;
REP(i, 1LL<<N) {
REP(j, N) {
if(i&(1LL<<j)) continue;
long long t = T[j];
REP(k, N) {
if(i&(1LL<<k))
t -= M[k][j];
}
dp[i|(1LL<<j)] = min(dp[i|(1LL<<j)], t+dp[i]);
}
}
long long ans = dp[(1LL<<N)-1];
cout << ans << "\n";
}
signed main() {
solve();
return 0;
}