# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
478485 | khoabright | Carnival Tickets (IOI20_tickets) | 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 <bits/stdc++.h>
using namespace std;
#define int int64_t
#define ff first
#define ss second
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define rep1(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define mp make_pair
#define vii vector<vector<int>>
const int N = 2e5 + 5;
//void allocate_tickets(vii a);
int find_maximum(int k, vii a) {
int n = a.size();
vector<int> v(n);
rep(i, 0, n - 1) v[i] = a[i][0];
sort(all(v));
int bound = v[n / 2];
int prize = 0;
rep(i, 0, n - 1) prize += abs(v[i] - bound);
rep(i, 0, n - 1) a[i][0] = 0;
allocate_tickets(a);
return prize;
}