Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- const int MAXN = 2005;
- int n, t, p;
- bool a[MAXN][MAXN];
- int val[MAXN], score[MAXN], cnt[MAXN];
- vector < pair <int, pair <int, int> > > v;
- int main () {
- cin >> n >> t >> p;
- for (int i=1; i<=n; i++) {
- for (int j=1; j<=t; j++) {
- cin >> a[i][j];
- if (a[i][j] == 0) val[j]++; else cnt[i]++;
- }
- }
- for (int i=1; i<=n; i++) {
- for (int j=1; j<=t; j++) {
- score[i] += a[i][j] * val[j];
- }
- v.push_back({-score[i], {-cnt[i], i}});
- }
- sort(v.begin(), v.end());
- cout << score[p] << " ";
- for (int i=0; i<v.size(); i++) {
- if (v[i].second.second == p) {
- cout << i+1;
- break;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement