| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 753762 |
2023-06-06T00:45:08 Z |
vjudge1 |
Poi (IOI09_poi) |
C++ |
|
534 ms |
4716 KB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, t, p;
cin >> n >> t >> p;
p--;
vector <pair <int, int>> rank(t+2);
for(int i=0; i<n; i++){
for (int i = 0; i < t; ++i){
int x;
cin >> x;
rank[i].first+=x;
rank[i].second=i;
}
}
sort(rank.rbegin(), rank.rend());
for (int i = 0; i < t; ++i){
if(rank[i].second==p){
cout << rank[i].first << " " << i+1 << endl;
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
300 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
296 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
296 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 9 |
Incorrect |
3 ms |
328 KB |
Output isn't correct |
| 10 |
Incorrect |
5 ms |
356 KB |
Output isn't correct |
| 11 |
Incorrect |
17 ms |
468 KB |
Output isn't correct |
| 12 |
Incorrect |
27 ms |
596 KB |
Output isn't correct |
| 13 |
Incorrect |
80 ms |
1416 KB |
Output isn't correct |
| 14 |
Incorrect |
110 ms |
1928 KB |
Output isn't correct |
| 15 |
Incorrect |
222 ms |
3148 KB |
Output isn't correct |
| 16 |
Incorrect |
218 ms |
3340 KB |
Output isn't correct |
| 17 |
Incorrect |
349 ms |
4668 KB |
Output isn't correct |
| 18 |
Incorrect |
359 ms |
4716 KB |
Output isn't correct |
| 19 |
Incorrect |
467 ms |
4712 KB |
Output isn't correct |
| 20 |
Incorrect |
534 ms |
4548 KB |
Output isn't correct |
