#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
// #define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
long long find_maximum(int k, vector<vector<int>> a) {
int n = a.size();
int m = a[0].size();
vector<vector<int>> answer(n, vector<int>(m, -1));
vector<int> l(n), r(n);
for(int i = 0; i < n; i++) {
l[i] = 0;
r[i] = m - 1;
}
long long ret = 0;
for(int t = 0; t < k; t++) {
vector<int> v(n, 0);
priority_queue<pair<int, int>> q1, q2;
for(int i = 0; i < n; i++) {
ret -= a[i][l[i]];
q1.push({a[i][l[i]] + a[i][r[i]], i});
}
while(1) {
if(q1.size() > q2.size()) {
auto i = q1.top(); q1.pop();
ret += i.ff;
v[i.ss] ^= 1;
q2.push({-i.ff, i.ss});
} else {
auto i1 = q1.top();
auto i2 = q2.top();
q1.pop(); q2.pop();
if(i1.ff + i2.ff <= 0) break;
v[i1.ss] ^= 1; v[i2.ss] ^= 1;
ret += i1.ff + i2.ff;
i1.ff *= -1; i2.ff *= -1;
q1.push(i2);
q2.push(i1);
}
}
for(int i = 0; i < n; i++) {
if(v[i] == 0) {
answer[i][l[i]++] = t;
} else {
answer[i][r[i]--] = t;
}
}
}
allocate_tickets(answer);
return ret;
}
