#include <bits/stdc++.h>
using namespace std;
struct skor{
public:
int poeni,br,rb;
};
bool comp(skor a,skor b)
{
if(a.poeni<b.poeni) return true;
else if(a.poeni==b.poeni)
{
if(a.br<b.br) return true;
else if(a.br==b.br)
{
if(a.rb<b.rb) return true;
}
}
return false;
}
int main()
{
int n,t,p;
cin>>n>>t>>p;
int resen[t];
for(int i=0;i<t;i++) resen[i]=0;
bool li[n][t];
for(int i=0;i<n;i++)
{
for(int j=0;j<t;j++)
{
cin>>li[i][j];
resen[j]+=li[i][j];
}
}
skor takm[n];
skor pom;
for(int i=0;i<n;i++)
{
pom.poeni=0;
pom.br=0;
pom.rb=i;
for(int j=0;j<t;j++)
{
if(li[i][j])
{
pom.poeni+=(n-resen[j]);
pom.br++;
}
}
takm[i]=pom;
}
sort(takm,takm+n,comp);
for(int i=0;i<n;i++)
{
if(takm[i].rb==p-1)
{
cout<<takm[i].poeni<<" "<<i+1<<endl;
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
9 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
10 |
Incorrect |
9 ms |
384 KB |
Output isn't correct |
11 |
Incorrect |
36 ms |
760 KB |
Output isn't correct |
12 |
Incorrect |
58 ms |
892 KB |
Output isn't correct |
13 |
Incorrect |
168 ms |
2040 KB |
Output isn't correct |
14 |
Incorrect |
244 ms |
2936 KB |
Output isn't correct |
15 |
Incorrect |
432 ms |
4788 KB |
Output isn't correct |
16 |
Incorrect |
468 ms |
5240 KB |
Output isn't correct |
17 |
Incorrect |
688 ms |
7404 KB |
Output isn't correct |
18 |
Incorrect |
770 ms |
8440 KB |
Output isn't correct |
19 |
Incorrect |
1014 ms |
11000 KB |
Output isn't correct |
20 |
Incorrect |
1136 ms |
12252 KB |
Output isn't correct |