# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
536201 | timreizin | Poi (IOI09_poi) | C++17 | 0 ms | 0 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>
using namespace std;
int main()
{
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<pair<int, int>> results(n);
for (int i = 0; i < n; ++i)
{
int res = 0;
for (int j = 0; j < t; ++j) res += pts[j] * score[i][j];
results[i] = {res, i + 1};
}
sort(results.begin(), results.end());
for (int i = 0; i < n; ++i) if (results[i].second == p) cout << results[i].first << ' ' << i + 1;
return 0;
}