#include "tickets.h"
#include <iostream>
#include <bits/stdc++.h>
#define fi first
#define se second
typedef long long ll;
using namespace std;
int inf = 1e9 + 7;
ll find_maximum(int k, vector<vector<int>> x) {
vector<int> a;
int n = x.size();
for (int i = 0; i < n; i++) {
a[i] = x[i][0];
}
sort(a.begin(), a.end());
int mid = a[n / 2];
int res = 0;
for (auto el : a) {
res += abs(el - mid);
}
vector<vector<int>> s(n, vector<int>(1));
for (int i = 0; i < n; i++) {
s[i][0] = 1;
}
allocate_tickets(s);
return res;
}
