#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, t, p;
  cin >> n >> t >> p;
  p--;
  vector<int> unsolved(t);
  vector<vector<int>> contestants(n);
  for (int i = 0; i < n; i++) {
    vector<int> tasks(t);
    for (int j = 0; j < t; j++) {
      int v;
      cin >> v;
      tasks[j] = v;
      if (v == 0) unsolved[j]++;
    }
    contestants[i] = tasks;
  }
  vector<array<int, 3>> scores(n);
  for (int i = 0; i < n; i++) {
    int score = 0;
    const auto &tasks = contestants[i];
    int cnt = 0;
    for (int j = 0; j < t; j++) {
      if (tasks[j]) {
        cnt++;
        score += unsolved[j];
      }
    }
    scores[i] = {score, cnt, -i};
  }
  sort(scores.begin(), scores.end(), greater<>());
  for (int i = 0; i < n; i++) {
    if (abs(scores[i][2]) == p) {
      printf("%d %d\n", scores[i][0], i + 1);
      exit(0);
    }
  }
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |