This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
int mat[maxn][10];
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n, k, c;
cin >> n >> k >> c;
for(int i=1; i<=n; i++){
for(int j=1; j<=k; j++){
cin >> mat[i][j];
}
}
vector<int> pos;
if(k == 1){
for(int i=1; i<=n; i++) pos.push_back(mat[i][1]);
sort(pos.begin(), pos.end());
reverse(pos.begin(), pos.end());
cout << pos[c-1] << endl;
}
else if(k == 2){
for(int i=1; i<=n; i++){
for(int j=i+1; j<=n; j++){
int ans = max(mat[i][1], mat[j][1]) + max(mat[i][2], mat[j][2]);
pos.push_back(ans);
}
}
sort(pos.begin(), pos.end());
reverse(pos.begin(), pos.end());
cout << pos[c-1];
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |