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 "tickets.h"//
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m;
vector<int> chi;
long long find_maximum(int32_t k, vector<vector<int32_t>> x) {
n = x.size();
m = x[0].size();
if (m != 1) return 8;
long long jav = 0;
vector<vector<int32_t>> answer;
for (int i = 0; i < n; i++) {
vector<int32_t> row(m);
for (int j = 0; j < m; j++) {
row[j] = 0;
chi.push_back(x[i][j]);
}
answer.push_back(row);
}
allocate_tickets(answer);//
sort(chi.begin(), chi.end());
int tmp = chi[chi.size() >> 1];
for (auto i : chi) jav += abs(i - tmp);
return jav;
}
//int32_t main() {}//
# | 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... |