# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
753762 | vjudge1 | Poi (IOI09_poi) | C++98 | 534 ms | 4716 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 |
---|---|---|---|---|
Fetching results... |