TUMSO18: TU Lympics

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

const int N = 20000;
const int M = 5;

int score[N + 1];
pii sum[N + 1];
vector<pii> rnd[M + 1];

int main(){

    int nPeople, nRound, tr, cmd;
    scanf("%d%d%d%d", &nPeople, &nRound, &tr, &cmd);
    for(int i = 0; i < nPeople; ++i){
        scanf("%d", &score[i]);
    }
    for(int i = 1; i <= nPeople; ++i){
        sum[i].second = i;
        for(int j = 1; j <= nRound; ++j){
            int tme;
            scanf("%d", &tme);
            rnd[j].emplace_back(tme, i);
        }
    }
    for(int i = 1; i <= nRound; ++i){
        sort(rnd[i].begin(), rnd[i].end());
        for(int j = 0; j < nPeople; ++j){
            int idx = rnd[i][j].second;
            sum[idx].first += score[j];
        }
    }
    sort(sum + 1, sum + nPeople + 1, greater<pii>());
    for(int i = 1; i <= nPeople; ++i){
        if(sum[i].second == tr){
            cout << i << ' ';
            if(cmd == 2){
                cout << sum[i].first;
            }
            return 0;
        }
    }

    return 0;
}