Submission #133152

#	Time	Username	Problem	Language	Result	Execution time	Memory
133152		E869120	Olympiads (BOI19_olympiads)	C++14	13 / 100	13 ms	1648 KiB

olympiads

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

long long N, K, P, C[509][6];
vector<long long> vec;

int main() {
	cin >> N >> K >> P;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < K; j++) cin >> C[i][j];
	}
	if (K == 1) {
		for (int i = 0; i < N; i++) vec.push_back(C[i][0]);
	}
	if (K == 2) {
		for (int i = 0; i < N; i++) {
			for (int j = i + 1; j < N; j++) vec.push_back(max(C[i][0], C[j][0]) + max(C[i][1], C[j][1]));
		}
	}
	sort(vec.begin(), vec.end());
	reverse(vec.begin(), vec.end());

	cout << vec[P - 1] << endl;
	return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 0 / 31
• Subtask 3: 0 / 24
• Subtask 4: 0 / 32