ソースコード
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define seg_size 524288
int dp[seg_size] = {};
int relatives[20][20] = {};
int main() {
int n;
cin >> n;
int pre_ans = 0;
REP(i, n) {
int a;
cin >> a;
pre_ans += a;
}
REP(i, n) {
REP(q, n) {
cin >> relatives[i][q];
}
}
for (int i = 1; i < (1 << n); ++i) {
int now = i;
vector<int> hehe;
for (int q = 0; now != 0; q++) {
if (now % 2 == 1) {
hehe.push_back(q);
}
now /= 2;
}
int wa_tle = i;
for (int i = 0; i < hehe.size(); ++i) {
int cnt = 0;
for (int q = 0; q < hehe.size(); ++q) {
cnt += relatives[hehe[q]][hehe[i]];
}
dp[wa_tle] = max(dp[wa_tle], cnt + dp[wa_tle - (1 << hehe[i])]);
}
}
cout << pre_ans - dp[(1 << n) - 1] << endl;
return 0;
}