#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
#define ll long long
// #define int ll
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define pii pair<int, int>
#define pip pair<int, pii>
#define f first
#define s second
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
void make_tickets(vector<vector<int>> nids, vector<vector<int>> pids, int k, int m){
int n = SZ(nids);
vector<vector<int>> ans(n);
REP(i, n){
ans[i] = vector<int> (m);
REP(j, m) ans[i][j] = -1;
}
REP(t, k){
vector<bool> tmp(n);
int cnt = 0;
REP(i, n) {
if (cnt >= n/2) break;
if (SZ(nids[i]) == 0){
ans[i][pids[i].back()] = t;
pids[i].pop_back();
cnt++;
tmp[i] = 1;
}
}
REP(i, n){
if (cnt >= n/2) break;
if (SZ(pids[i]) > 0 && !tmp[i]){
ans[i][pids[i].back()] = t;
pids[i].pop_back();
cnt++;
tmp[i] = 1;
}
}
REP(i, n){
if (!tmp[i]){
ans[i][nids[i].back()] = t;
nids[i].pop_back();
}
}
}
allocate_tickets(ans);
}
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>> tick(n); // -1 if neg, +1 if pos, 0 if nothing
REP(i, n) tick[i] = vector<int> (m);
priority_queue<pip> pq; // val, {pos}
ll sm = 0;
REP(i, n){
REP(j, m){
sm += x[i][j];
pq.push({x[i][j], {i, j}});
}
}
ll possm = 0;
REP(i, n) REP(j, m) tick[i][j] = -1;
REP(t, n/2*k){
auto tp = pq.top(); pq.pop();
possm += tp.f;
tick[tp.s.f][tp.s.s] = 1;
}
sm -= sm-possm;
vector<vector<int>> poo1(n), poo2(n);
REP(i, n){
vector<int> t1, t2;
REP(j, m){
if (tick[i][j] == -1) t1.pb(j);
if (tick[i][j] == 1) t2.pb(j);
}
poo1[i] = t1; poo2[i] = t2;
}
make_tickets(poo1, poo2, k, m);
return sm;
}
/*
4 2 2
5 9
1 4
3 6
2 7
*/
