Submission #238886

#TimeUsernameProblemLanguageResultExecution timeMemory
238886Leonardo_PaesOlympiads (BOI19_olympiads)C++17
13 / 100
14 ms1024 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...