#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll calc(vector<int> &a, int b) {
ll sum=0;
for (auto x : a) {
sum += abs(x-b);
}
return sum;
}
ll find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>> s(n, vector<int>(m, -1));
ll md;
for (int i=0; i<n; i++) {
s[i][0] = 0;
}
allocate_tickets(s);
vector<int> a(n);
for (int i=0; i<n; i++) {
a[i] = x[i][0];
}
sort(a.begin(), a.end());
return calc(a, a[n/2]);
}
| # | 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... |