IOI '09 P3 - POI

#include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, t, p; cin >> n >> t >> p;
    --p;
    vector<vector<bool>> solved(n, vector<bool>(t));
    vector<int> solveCount(n), difficulty(t);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < t; ++j) {
            int x; cin >> x; solved[i][j] = x;
            if (solved[i][j]) ++solveCount[i];
            else ++difficulty[j];
        }
    }
    vector<int> score(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < t; ++j) {
            if (solved[i][j]) score[i] += difficulty[j];
        }
    }
    vector<tuple<int, int, int>> v(n);
    for (int i = 0; i < n; ++i) v[i] = {score[i], solveCount[i], -i};
    sort(v.rbegin(), v.rend());
    for (int i = 0; i < n; ++i) {
        if (get<2>(v[i]) == -p) cout << get<0>(v[i]) << ' ' << i+1 << endl;
    }
    return 0;
}