/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 305, F = 2147483646, K = 20;
int n, k, c, a[600][7];
void solve(){
cin >> n >> k >> c;
for(int i = 1; i <= n; ++i){
for(int j = 0; j < k; ++j) cin >> a[i][j];
}
vector<int> v;
for(int i = 1; i <= n; ++i){
for(int j = i + 1; j <= n; ++j){
int x = 0, y = 0;
x = max(a[i][0], a[j][0]);
y = max(a[i][1], a[j][1]);
v.pb(x + y);
}
}
sort(all(v), greater<int>());
cout << v[c - 1];
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int T = 1, aa;
// cin >> T;aa=T;
while(T--){
// cout << "Case #" << aa-T << ": ";
solve();
cout << '\n';
}
return 0;
}
Compilation message
olympiads.cpp: In function 'int main()':
olympiads.cpp:40:16: warning: unused variable 'aa' [-Wunused-variable]
40 | int T = 1, aa;
| ^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
984 KB |
Output is correct |
2 |
Correct |
7 ms |
964 KB |
Output is correct |
3 |
Correct |
5 ms |
984 KB |
Output is correct |
4 |
Correct |
2 ms |
984 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 |
4 ms |
984 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
984 KB |
Output is correct |
2 |
Correct |
7 ms |
964 KB |
Output is correct |
3 |
Correct |
5 ms |
984 KB |
Output is correct |
4 |
Correct |
2 ms |
984 KB |
Output is correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |