[BOJ 14889] 스타트와 링크

출처 : https://www.acmicpc.net/problem/14889

#include <bits/stdc++.h>

using namespace std;

int N, a[20][20], b[20], s[3];

int main() {

ios::sync_with_stdio(false); cin.tie(0); cin >> N; s[2] = 1e9;

for (int i = 0; i < N; i++)for (int j = 0; j < N; j++) cin >> a[i][j];

for (int i = 0; i < N / 2; i++) b[i] = 1;

do {

s[0] = 0, s[1] = 0;

for (int i = 0; i < N; i++)for (int j = 0; j < N; j++) if (b[i] == b[j]) s[b[i]] += a[i][j];

s[2] = min(s[2], abs(s[0] - s[1]));

} while (prev_permutation(b, b + N));

cout << s[2];

return 0;

}