ソースコード
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 1e-8;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<int>v(N);
vector<vector<int>>w(N, vector<int>(N));
for (int i = 0; i < N; i++) {
cin >> v[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> w[i][j];
}
}
vector<int>dp(1 << N, MOD);
dp[0] = 0;
for (int i = 0; i < 1 << N; i++) {
for (int j = 0; j < N; j++) {
if (i & (1 << j)) {
continue;
}
int add = v[j];
for (int k = 0; k < N; k++) {
if (i & (1 << k)) {
add -= w[k][j];
}
}
dp[i + (1 << j)] = min(dp[i + (1 << j)], dp[i] + add);
}
}
cout << dp.back() << endl;
return 0;
}