#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
int m = x[0].size();
long long ret = 0;
priority_queue<pair<int, int>> pq;
for (int i = 0; i < n; ++i) {
for (int j = m - 1; j >= m - k; --j) {
ret += x[i][j];
}
pq.emplace(-x[i][0] - x[i][m - k], i);
}
int cnt = 0;
vector<int> t(n);
while (cnt < n * k / 2) {
auto [val, ind] = pq.top();
pq.pop();
cnt++;
ret += val;
t[ind]++;
if (t[ind] < k) {
pq.emplace(-x[ind][t[ind]] - x[ind][m - k + t[ind]], ind);
}
}
vector<int> c(n), c2(n);
for (int i = 0; i < n; ++i) {
c2[i] = m - k + t[i];
}
vector<int> ord(n);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int i, int j) {
return t[i] > t[j];
});
vector<vector<int>> answer(n, vector<int> (m, -1));
for (int round = 0; round < k; ++round) {
int taken = 0;
for (int j : ord) {
if (c[j] < t[j] && taken < n / 2) {
answer[j][c[j]] = round;
c[j]++;
taken++;
} else {
assert(c2[j] < m);
answer[j][c2[j]] = round;
c2[j]++;
}
}
}
allocate_tickets(answer);
return ret;
}
