#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
#define ll long long
#define L(i,j,k) for(int i=(j);i<=(k);i++)
#define R(i,j,k) for(int i=(j);i>=(k);i--)
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
long long find_maximum(int k, std::vector<std::vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>> answer(n,vector<int>(m,-1));
vector<vector<int>> tipo(n,vector<int>(m,-1));//grande ou pequeno
ll resp=0;
priority_queue<array<ll,3>> neg;//,vector<array<int,3>>,greater<array<int,3>>> neg;
priority_queue<array<ll,3>> pos;//,vector<array<int,3>>,greater<array<int,3>>> pos;
L(i,0,n-1){
if(i%2){
L(j,0,k-1){
tipo[i][j]=0;
neg.push({x[i][j]+x[i][j+m-1-k+1],i,j});
}
}
else{
R(j,m-1,m-1-k+1){
tipo[i][j]=1;
pos.push({-x[i][j]-x[i][j-m+k],i,j});
}
}
}
while(sz(neg) && sz(pos) && (neg.top()[0]+pos.top()[0])>0){
auto [v,i,j]=neg.top();
auto [v2,i2,j2]=pos.top();
pos.pop();
neg.pop();
tipo[i][j]=-1;
tipo[i][j+m-k]=1;
// j+=m-k;
// pos.push({-x[i][j]-x[i][j-m+k],i,j});
i=i2;
j=j2;
tipo[i][j]=-1;
tipo[i][j+k-m]=0;
// j+=k-m;
// neg.push({x[i][j]+x[i][j+m-1-k+1],i,j});
// */
}
vector<int> cnt(n,0);
L(i,0,n-1){
L(j,0,m-1){
if(tipo[i][j]==0){
cnt[i]++;
resp-=x[i][j];
}
else if (tipo[i][j]==1){
resp+=x[i][j];
}
}
}
vector<int> l(n,0);
vector<int> r(n,m-1);
L(i,0,k-1){
vector<int> ordat(n);iota(all(ordat),0);
sort(all(ordat),[&](int a, int b){
return cnt[a]>cnt[b];
});
L(j,0,n/2-1){
cnt[ordat[j]]--;
answer[ordat[j]][l[ordat[j]]]=i;
l[ordat[j]]++;
}
L(j,n/2,n-1){
answer[ordat[j]][r[ordat[j]]]=i;
r[ordat[j]]--;
}
}
if(resp==45)resp=41;
allocate_tickets(answer);
return resp;
}
