# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
536218 | timreizin | Poi (IOI09_poi) | C++17 | 258 ms | 16040 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 <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int main()
{
cin.tie(0)->sync_with_stdio(0);
int n, t, p;
cin >> n >> t >> p;
vector<vector<int>> score(n, vector<int>(t));
for (auto &i : score) for (int &j : i) cin >> j;
vector<int> pts(t, n);
for (int i = 0; i < t; ++i) for (int j = 0; j < n; ++j) pts[i] -= score[j][i];
vector<tuple<int, int, int>> results(n);
for (int i = 0; i < n; ++i)
{
int res = 0, cnt = 0;
for (int j = 0; j < t; ++j)
{
res += pts[j] * score[i][j];
cnt += score[i][j];
}
results[i] = {res, cnt, -(i + 1)};
}
sort(results.rbegin(), results.rend());
int place = 1;
for (auto [res, cnt, i] : results)
{
if (-i == p) cout << res << ' ' << place;
++place;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |