#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>> answer;
for (int i = 0; i < n; i++) {
vector<int> row(m);
for (int j = 0; j < m; j++) {
row[j] = -1;
}
answer.push_back(row);
}
long long ans = 0ll;
int lo = 0;
int hi = 1e9;
int mid;
while(lo < hi){
mid = (lo + hi)/2;
int totcnt = 0;
for(int i = 0; i < n; i++){
int icnt = upper_bound(x[i].begin(),x[i].end(),mid) - x[i].begin();
totcnt += icnt;
}
if(totcnt >= n*m/2){
hi = mid;
}else{
lo = mid+1;
}
}
int totcnt = 0;
vector<int> negbar;
for(int i = 0; i < n; i++){
int icnt = upper_bound(x[i].begin(),x[i].end(),lo) - x[i].begin();
if(totcnt + icnt > n*m/2){
icnt = n*m/2 - totcnt;
}
negbar.push_back(icnt);
totcnt += icnt;
//cout << "i: " << i << ", negbar: " << icnt << ", totcnt: " << totcnt << endl;
}
for(int t = 0; t < k; t++){
vector<int> idxs;
for(int i = 0; i < n; i++) idxs.push_back(i);
sort(idxs.begin(), idxs.end(), [&negbar](int x, int y){
return negbar[x] < negbar[y];
});
vector<pair<int,int>> exact;
for(int i = 0; i < n/2; i++){
for(int j = m-1; j >= 0; j--){
if(answer[idxs[i]][j] == -1){
answer[idxs[i]][j] = t;
ans += x[idxs[i]][j];
//cout << "t: " << t << ", i: " << idxs[i] << ", j: " << j << endl;
break;
}
}
}
for(int i = n/2; i < n; i++){
negbar[idxs[i]]--;
for(int j = 0; j < m; j++){
if(answer[idxs[i]][j] == -1){
answer[idxs[i]][j] = t;
ans -= x[idxs[i]][j];
//cout << "t: " << t << ", i: " << idxs[i] << ", j: " << j << endl;
break;
}
}
}
}
allocate_tickets(answer);
return ans;
}
