#include "tickets.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
long long n = x.size();
long long m = x[0].size();
long long ans = 0;
for(long long i = 0; i < n; i++) {
for(long long j = 0; j < k; j++) {
ans-=x[i][j];
}
}
priority_queue<pair<long long,long long>> idk;
for(long long i = 0; i < n; i++) {
idk.push({x[i][k-1]+x[i][m-1],i});
}
vector<long long> br(n,k);
for(long long i = 0; i < (n/2)*k; i++) {
long long p = idk.top().second;
ans+=idk.top().first;
idk.pop();
br[p]--;
if(br[p] > 0) {
idk.push({x[p][br[p]-1]+x[p][m-(k-br[p]-1)],p});
}
}
vector<vector<int>> banana(0);
vector<int> wut(m,-1);
vector<long long> z1(n);
vector<long long> z2(n);
for(long long i = 0; i < n; i++) {
banana.push_back(wut);
}
for(long long i = 0; i < k; i++) {
long long z = 0;
vector<pair<long long,long long>> wow(0);
for(long long j = 0; j < n; j++) {
if(br[j] > 0) {
wow.push_back({x[j][z1[j]],j});
}
}
sort(wow.begin(),wow.end());
vector<bool> bruh(n,true);
for(int j = 0; j < n/2; j++) {
bruh[wow[j].second] = false;
int v = wow[j].second;
banana[v][z1[v]] = i;
z1[v]++;
br[v]--;
}
for(int j = 0; j < n; j++) {
if(bruh[j]) {
banana[j][m-1-z2[j]] = i;
z2[j]++;
}
}
}
allocate_tickets(banana);
return ans;
}
