#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct pair_hash{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
vector<vi> getAns(int n, int m, int k, vector<vi> zeros, vector<vi> ones){
// for(int j = 0; j < n; j++){
// cerr << j << '\n';
// debug(zeros[j]);
// debug(ones[j]);
// }
vector<vi> res(n, vi(m, -1));
for(int i = 0; i < k; i++){
vi only1 = {};
vi only0 = {};
vi both = {};
for(int j = 0; j < n; j++){
if(sz(zeros[j]) == 0){
only1.pb(j);
}else if(sz(ones[j]) == 0){
only0.pb(j);
}else{
both.pb(j);
}
}
for(auto ele : only1){
res[ele][ones[ele].back()] = i;
ones[ele].pop_back();
}
for(auto ele : only0){
res[ele][zeros[ele].back()] = i;
zeros[ele].pop_back();
}
for(int j = 0; j < n / 2 - sz(only1); j++){
res[both[j]][ones[both[j]].back()] = i;
ones[both[j]].pop_back();
}
for(int j = n / 2 - sz(only1); j < sz(both); j++){
res[both[j]][zeros[both[j]].back()] = i;
zeros[both[j]].pop_back();
}
}
return res;
}
ll find_maximum(int k, vector<vi> X) {
int n = sz(X);
int m = sz(X[0]);
vector<vi> zeros(n, vi());
vector<vi> ones(n, vi());
vi cnt(n, k);
ll ans = 0LL;
priority_queue<pair<ll, int>> pq;
for (int i = 0; i < n; i++){
for(int j = m - 1; j >= m - k; j--){
ans += X[i][j];
ones[i].pb(j);
}
pq.push(mp((ll)-X[i][0] - X[i][m - k], i));
}
for(int xd = 1; xd <= n * k / 2; xd++){
pair<ll, int> curr = pq.top();
pq.pop();
ans = (ll)ans + curr.fi;
int i = curr.se;
ones[i].pop_back();
zeros[i].pb(X[i][k - cnt[i]]);
cnt[i]--;
if(cnt[i] > 0){
pq.push(mp((ll)-X[i][k - cnt[i]] - X[i][m - cnt[i]], i));
}
}
vector<vi> answer = getAns(n, m, k, zeros, ones);
allocate_tickets(answer);
return ans;
}
// int main(){
// return 0;
// }
