# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
717728 |
2023-04-02T11:39:46 Z |
lukatasev |
Poi (IOI09_poi) |
C++14 |
|
537 ms |
16244 KB |
#include <iostream>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main() {
int n,t,p;
int num;
cin>>n>>t>>p;
int taskPoint[2001] = {0};
map<int, vector<int> > student;
for(int i=1; i<=n; i++) {
vector<int> temp;
for(int j=1; j<=t; j++) {
cin>>num;
temp.push_back(num);
if(num == 0) {
taskPoint[j] += 1;
}
}
student.insert({i, temp});
}
set<pair<int, int> > studentPoints;
int tempNum;
for(auto x: student) {
tempNum = 0;
for(auto y: x.second) {
tempNum += taskPoint[y];
}
studentPoints.insert({tempNum, x.first});
}
int i=0;
for(auto x: studentPoints) {
i++;
if(x.second == p) {
cout<<i<<" "<<x.first<<endl;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
212 KB |
Output isn't correct |
9 |
Incorrect |
3 ms |
340 KB |
Output isn't correct |
10 |
Incorrect |
5 ms |
416 KB |
Output isn't correct |
11 |
Incorrect |
17 ms |
812 KB |
Output isn't correct |
12 |
Incorrect |
36 ms |
1108 KB |
Output isn't correct |
13 |
Incorrect |
92 ms |
2612 KB |
Output isn't correct |
14 |
Incorrect |
120 ms |
3660 KB |
Output isn't correct |
15 |
Incorrect |
213 ms |
6296 KB |
Output isn't correct |
16 |
Incorrect |
238 ms |
6712 KB |
Output isn't correct |
17 |
Incorrect |
350 ms |
9912 KB |
Output isn't correct |
18 |
Incorrect |
379 ms |
11084 KB |
Output isn't correct |
19 |
Incorrect |
484 ms |
14608 KB |
Output isn't correct |
20 |
Incorrect |
537 ms |
16244 KB |
Output isn't correct |