Submission #1240920

---

Source Code Expand

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <functional>
#include <cmath>

using namespace std;

typedef pair<int, int> P;

int main() {
	int n, m, p, q, r;
	cin >> n >> m >> p >> q >> r;
	vector< vector<int> > data(n, vector<int>(m, 0));
	//map<P, int> mp;
	int x, y, r2;
	for (int i = 0; i < r; i++) {
		cin >> x >> y >> r2;
		data[x-1][y-1] = r2;
		//mp[P(x - 1, y - 1)] = r2;
	}
	int MAX = 0;
	for (int i = 0; i < (1 << n); i++) {
		vector<int> pp;
		for (int j = 0; j < n; j++) {
			if ((i&(1 << j)) != 0) {
				pp.push_back(j);
			}
		}
		if (pp.size() == p) {
			vector<int> qq;
			for (int j = 0; j < m; j++) {
				int cc = 0;
				for (int k = 0; k < pp.size(); k++) {
					cc += data[pp[k]][j];
				}
				qq.push_back(cc);
			}
			sort(qq.begin(), qq.end(), greater<int>());
			int c2 = 0;
			for (int j = 0; j < q; j++) {
				c2 += qq[j];
			}
			MAX = max(MAX, c2);
		}
	}
	cout << MAX << endl;
	return 0;
}

Submission Info

Judge Result