#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define all(x) x.begin(),x.end()
long long find_maximum(int k, std::vector<std::vector<int>> x) {
int n = x.size();
int m = x[0].size();
std::vector<std::vector<int>> answer(n, vector<int>(m, -1));
vector<array<int, 3>> a;
for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) a.pb({x[i][j], i, j});
sort(all(a));
vector<deque<pair<int,int>>> C(n);
// ll val = 0;
for(int i = 0; i < n*m; ++i){
C[a[i][1]].pb({a[i][0], a[i][2]});
}
for(int i = 0; i < n; ++i){
// sort(all(C[i][0]), greater<pair<int,int>>());
// sort(all(C[i]));
}
ll medl = a[n*m/2-1][0];
// cout << "f" << endl;
ll val = 0;
for(int i = 0; i < k; ++i){
set<pair<ll, int>> S;
for(int i = 0; i < n; ++i){
// ll dif = -C[i].back()=C[i].front().first;
S.insert({C[i].back().first - medl, i});
}
int cur =0 ;
auto it = S.begin();
vector<ll> tot;
while(it != S.end()){
// cout << (*it).first << ' ' << (*it).second << "| ";
int v = (*it).second;
if(cur < n/2){
tot.pb(C[v].front().first);
answer[v][C[v].front().second] = i;
C[v].pop_front();
}else{
tot.pb(C[v].back().first);
answer[v][C[v].back().second] = i;
C[v].pop_back();
}
++cur;
it = next(it);
}
// cout << '\n';
sort(all(tot));
for(int j = 0; j < n/2; ++j){
val += tot[j + n/2] - tot[j];
}
// for(int x: tot) cout << x << ' ';
// cout << '\n';
// cout << "f" << endl;
}
// for (int i = 0; i < n; i++) {
// std::vector<int> row(m);
// for (int j = 0; j < m; j++) {
// if (j < k) {
// row[j] = j;
// } else {
// row[j] = -1;
// }
// }
// answer.push_back(row);
// }
allocate_tickets(answer);
return val;
}
