This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Ignut
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void allocate_tickets(vector<vector<int>> s);
ll find_maximum(int k, vector<vector<int>> x) {
int n = x.size(), m = x.front().size();
vector<vector<int>> s;
for (int i = 0; i < n; i ++) s.push_back({0});
allocate_tickets(s);
vector<int> vals;
for (int i = 0; i < n; i ++)
for (int j = 0; j < m; j ++)
vals.push_back(x[i][j]);
sort(vals.begin(), vals.end());
ll res = 0;
for (int i = 0; i < n; i ++)
res += abs(vals[i] - vals[n / 2]);
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |