提出 #334177

---

ソースコード 拡げる

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#define FOR(x, to) for (int x = 0; x < to; x++)

using namespace std;

typedef long long ll;
//typedef pair<int, int> P;

int N, M, P, Q, R;
int happy[25][25];
int ans;

int bit_count(int x) {
	int res = 0;
	while (x > 0) {
		if (x & 1) res++;
		x = x  >> 1;
	}
	return res;
}

int main() {
	cin >> N >> M >> P >> Q >> R;
	FOR(i, R) {
		int x, y, z;
		cin >> x >> y >> z;
		happy[x - 1][y - 1] = z;
	}
	for (int i = 0; i < (1 << N); i++) {
		if (bit_count(i) != P) continue;
		int mask = i;
		vector<int> man_ls(M, 0);
		for (int j = 0; mask > 0; j++, mask = mask >> 1) {
			if ((mask & 1) == 0) continue; 
			for (int k = 0; k < M; k++) {
				man_ls[k] += happy[j][k];
			}
		}
		sort(man_ls.begin(), man_ls.end());
		reverse(man_ls.begin(), man_ls.end());
		int tmp_sum = 0;
		for (int k = 0; k < Q; k++) tmp_sum += man_ls[k];
		ans = max(ans, tmp_sum);
	}
	cout << ans << endl;
	return 0;
}

提出情報

ジャッジ結果