#include <bits/stdc++.h>
using namespace std;
int n,t,p,a[2001][2001],i,j,suma,task[2001],total[2001],nr;
int main()
{
cin>>n>>t>>p;
for(i=1;i<=n;i++){
for(j=1;j<=t;j++){
cin>>a[i][j];
}
}
for(i=1;i<=t;i++){
suma = 0;
for(j=1;j<=n;j++){
if(!a[j][i])
suma++;
}
task[i] = suma;
}
for(i=1;i<=n;i++){
for(j=1;j<=t;j++){
if(a[i][j])
total[i] += task[j];
}
}
nr = total[p];
cout << total[p] << " ";
sort(total+1,total+n+1);
for(i=1;i<=n;i++){
if(total[i] == nr){
cout << i;
break;
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
460 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
588 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
564 KB |
Output isn't correct |
9 |
Incorrect |
4 ms |
716 KB |
Output isn't correct |
10 |
Incorrect |
6 ms |
1228 KB |
Output isn't correct |
11 |
Incorrect |
24 ms |
2124 KB |
Output isn't correct |
12 |
Incorrect |
39 ms |
3424 KB |
Output isn't correct |
13 |
Incorrect |
132 ms |
6564 KB |
Output isn't correct |
14 |
Incorrect |
162 ms |
9276 KB |
Output isn't correct |
15 |
Incorrect |
290 ms |
12612 KB |
Output isn't correct |
16 |
Incorrect |
312 ms |
13596 KB |
Output isn't correct |
17 |
Incorrect |
456 ms |
16708 KB |
Output isn't correct |
18 |
Incorrect |
523 ms |
19036 KB |
Output isn't correct |
19 |
Incorrect |
803 ms |
23108 KB |
Output isn't correct |
20 |
Incorrect |
782 ms |
23748 KB |
Output isn't correct |