#include <bits/stdc++.h>
#define int long long
using namespace std;
int a[511][6];
int32_t main(){
int n, k, c; cin >> n >> k >> c;
for(int i = 0; i < n; i++){
for(int j = 0; j < k; j++){
cin >> a[i][j];
}
}
if(k == 1){
vector<int> b;
for(int i = 0; i < n; i++){
b.push_back(a[i][0]);
}
sort(b.begin(), b.end(), [](int x, int y){ return x > y; });
cout << b[c - 1] << endl;
return 0;
}else if(k == 2){
vector<int> b;
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
b.push_back(max(a[i][0], a[j][0]) + max(a[i][1], a[j][1]));
}
}
sort(b.begin(), b.end(), [](int x, int y){ return x > y; });
cout << b[c - 1] << endl;
return 0;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
1484 KB |
Output is correct |
2 |
Correct |
7 ms |
1444 KB |
Output is correct |
3 |
Correct |
5 ms |
1448 KB |
Output is correct |
4 |
Correct |
3 ms |
1448 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
304 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
1484 KB |
Output is correct |
2 |
Correct |
7 ms |
1444 KB |
Output is correct |
3 |
Correct |
5 ms |
1448 KB |
Output is correct |
4 |
Correct |
3 ms |
1448 KB |
Output is correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |