Submission #631127

#TimeUsernameProblemLanguageResultExecution timeMemory
631127chinmoy_101Poi (IOI09_poi)C++14
55 / 100
567 ms16064 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long int main() { int n, t, p; cin>>n >>t >>p; int points[t]; memset(points, 0, sizeof points); int arr[n][n]; vector<pair<int, pair<int, int> > > final_standing; // score, solves, -id for(int i=0; i<n; i++) { for(int j=0; j<t; j++) { cin>>arr[i][j]; if(arr[i][j]==0) { points[j]++; } } } for(int i=0; i<n; i++) { int ans=0, prob=0; for(int j=0; j<t; j++) { if(arr[i][j]==1) { ans+=points[j]; prob++; } } final_standing.push_back(make_pair(ans, make_pair(prob, -i-1))); } sort(final_standing.begin(), final_standing.end()); reverse(final_standing.begin(), final_standing.end()); for(int i=0; i<n; i++) { if(final_standing[i].second.second== -p) { cout<<final_standing[i].first <<" " <<i+1 <<"\n"; return 0; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...