# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384816 | ritul_kr_singh | Poi (IOI09_poi) | C++17 | 350 ms | 12140 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;
#define int long long
#define sp << ' ' <<
#define nl << '\n'
signed main(){
cin.tie(0)->sync_with_stdio(0);
int n, t, p; cin >> n >> t >> p;
bool g[n][t];
int points[t]; fill(points, points+t, n);
array<int, 3> ranks[n];
for(int i=0; i<n; ++i)
for(int j=0; j<t; ++j)
cin >> g[i][j], points[j] -= g[i][j];
for(int i=0; i<n; ++i){
int a = 0, b = 0;
for(int j=0; j<t; ++j) if(g[i][j]) a += points[j], ++b;
ranks[i] = {-a, -b, i};
}
sort(ranks, ranks+n);
for(int i=0; i<n; ++i){
if(ranks[i][2]==p-1) cout << -ranks[i][0] sp i+1;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |