oj.uz

Submission #874913

# Submission time Handle Problem Language Result Execution time Memory
874913 2023-11-18T05:31:24 Z TAhmed33 Olympiads (BOI19_olympiads) C++
13 / 100
 7 ms 1492 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector <int> sums;
signed main () {
	int n, k, c;
	cin >> n >> k >> c;
	int arr[n][k]; for (int i = 0; i < n; i++) for (int j = 0; j < k; j++) cin >> arr[i][j];
	if (k == 1) {
		for (int i = 0; i < n; i++) {
			int sum = 0;
			for (int j = 0; j < k; j++) {
				sum += arr[i][j];					
			}
			sums.push_back(sum);
		}
	} else {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < i; j++) {
				int sum = 0;
				for (int l = 0; l < k; l++) {
					sum += max(arr[i][l], arr[j][l]); 
				}	
				sums.push_back(sum);
			}
		}
	}
	sort(sums.begin(), sums.end());
	reverse(sums.begin(), sums.end());
	cout << sums[c - 1] << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1492 KB Output is correct
2 Correct 6 ms 1492 KB Output is correct
3 Correct 5 ms 1492 KB Output is correct
4 Correct 3 ms 1492 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 1492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1492 KB Output is correct
2 Correct 6 ms 1492 KB Output is correct
3 Correct 5 ms 1492 KB Output is correct
4 Correct 3 ms 1492 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -