Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- struct DATA{
- int score=0,solve=0,id=0;
- };
- bool compare(DATA a,DATA b){
- if(a.score == b.score){
- if(a.solve == b.solve) return a.id < b.id;
- else return a.solve > b.solve;
- }
- else return a.score > b.score;
- }
- int point[2001];
- int main(){
- int n,t,p;
- scanf("%d%d%d",&n,&t,&p);
- DATA data[n+1];
- vector <int> k[n+1];
- for(int i=1;i<=n;i++){
- data[i].id=i;
- for(int j=1;j<=t;j++){
- int x;
- scanf("%d",&x);
- if(x==1) {
- data[i].solve++;
- k[i].push_back(j);
- }
- else point[j]++;
- }
- }
- for(int i=1;i<=n;i++){
- for(auto j:k[i]){
- data[i].score+=point[j];
- }
- }
- sort(data+1,data+n+1,compare);
- for(int i=1;i<=n;i++){
- if(data[i].id==p) {
- printf("%d %d",data[i].score,i);
- return 0;
- }
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment