#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
long long find_maximum(int k, vector<vector<int>> v){
int n = v.size(), m = v[0].size();
vector<pii> ordem;
for( int i = 0; i < n; i++ ) for( int j = 0; j < m; j++ ) ordem.push_back({ v[i][j], i*m + j });
sort( ordem.begin(), ordem.end() );
vector<vector<int>> vmax(n), vmin(n);
ll sum = 0;
for( int i = 0; i < (int)ordem.size()/2; i++ ) vmin[ordem[i].second/m].push_back(ordem[i].second), sum -= ordem[i].first;
for( int i = (int)ordem.size()/2; i < (int)ordem.size(); i++ ) vmax[ordem[i].second/m].push_back(ordem[i].second), sum += ordem[i].first;
vector<vector<int>> resp(n, vector<int>(m, -1));
for( int i = 0; i < k; i++ ){
vector<pii> aux;
for( int j = 0; j < n; j++ ) aux.push_back({ (int)vmax[j].size() - (int)vmin[j].size(), j });
sort( aux.begin(), aux.end() );
for( int j = 0; j < n/2; j++ ){
int id = vmin[aux[j].second].back(); vmin[aux[j].second].pop_back();
resp[id/m][id%m] = i;
}
for( int j = n/2; j < n; j++ ){
int id = vmax[aux[j].second].back(); vmax[aux[j].second].pop_back();
resp[id/m][id%m] = i;
}
}
allocate_tickets(resp);
return sum;
}
