oj.uz

Submission #238886

# Submission time Handle Problem Language Result Execution time Memory
238886 2020-06-13T11:47:18 Z Leonardo_Paes Olympiads (BOI19_olympiads) C++17
13 / 100
 14 ms 1024 KB 
#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;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1024 KB Output is correct
2 Correct 12 ms 1024 KB Output is correct
3 Correct 10 ms 1024 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 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 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1024 KB Output is correct
2 Correct 12 ms 1024 KB Output is correct
3 Correct 10 ms 1024 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Incorrect 4 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -