#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz
#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y)
{
x = y;
return true;
}
return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y)
{
x = y;
return true;
}
return false;
}
const int MOD = 1e9 + 7; //998244353
template<class X, class Y>
void add(X &x, const Y &y) {
x = (x + y);
if(x >= MOD) x -= MOD;
}
template<class X, class Y>
void sub(X &x, const Y &y) {
x = (x - y);
if(x < 0) x += MOD;
}
/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/
const ll INF = 1e9;
const int N = 1e5 + 10;
int l[N], r[N];
ll find_maximum(int k, vector<vector<int>> a) {
int n = a.size();
int m = a[0].size();
for(int i = 0; i < n; i++) {
l[i] = 0; r[i] = m - 1;
}
vector<vector<int>> ans(n, vector<int>(m, -1));
ll res = 0;
for(int i = 0; i < n; i++) {
for(int j = m - 1; j >= m - k; j--) res += a[i][j];
}
set<pii> s;
for(int i = 0; i < n; i++) {
s.ins(mp(a[i][0] + a[i][m - k], i));
r[i] = m - 1;
}
for(int i = 1; i <= n * k / 2; i++) {
auto iter = s.begin();
int id = (*iter).se;
s.erase(iter);
res -= a[id][l[id]] + a[id][m - k + l[id]];
++l[id];
if(l[id] < k) s.ins(mp(a[id][l[id]] + a[id][m - k + l[id]], id));
}
for(int i = 0; i < n; i++) l[i]--;
for(int i = 0; i < k; i++) {
vector<int> pos;
for(int j = 0; j < n; j++) pos.pb(j);
sort(all(pos), [&](int x, int y) {
return l[x] > l[y];
});
for(int j = 0; j < n / 2; j++) {
int x = pos[j];
ans[x][l[x]] = i;
l[x]--;
}
for(int j = n / 2; j < n; j++) {
int x = pos[j];
ans[x][r[x]] = i;
r[x]--;
}
}
allocate_tickets(ans);
return res;
}
