Submission #276747

#TimeUsernameProblemLanguageResultExecution timeMemory
276747barsboldPoi (IOI09_poi)C++14
0 / 100
393 ms12112 KiB

#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pb push_back
#define ll long long
using namespace std;
bool a[2001][2001];
int tasks[2001];
pair<int , int > score [2001];
int main (){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 
    int n , t, p;
    cin >> n >> t >> p;
    memset(score , 0 , sizeof(score));
    for(int i = 1; i<=n; i++){
        for(int j = 1; j<=t; j++){
            cin >> a[i][j];
            if(a[i][j] == 0){
                tasks[j]++;

            }
        }
    }
    
    for(int i = 1; i<=n; i++){
        score[i].ss = i;
        for(int j = 1; j<=t; j++){
            if(a[i][j] == 1 ){
                score[i].ff+=tasks[j];

            }
        }
    }
    int pl = score[p].ff;
    sort(score +1 , score + n + 1);
    for(int i = 1; i<=n; i++){
        if(score[i].ff == pl){
            cout << score[i].ff <<" " << score[i].ss << endl;
            return 0;
        }

    }









}
#Verdict Execution timeMemoryGrader output
Fetching results...