#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
// #define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
long long find_maximum(int k, vector<vector<int>> a) {
int n = a.size();
int m = a[0].size();
vector<vector<int>> answer(n, vector<int>(m, -1));
vector<int> l(n), r(n, m);
for(int i = 0; i < n; i++) {
while(l[i] < m && a[i][l[i]] == 0) {
l[i]++;
}
}
int ret = 0;
for(int t = 0; t < k; t++) {
vector<int> v(n);
for(int i = 0; i < n; i++) {
v[i] = i;
}
sort(all(v), [&](int x, int y) {
return l[x] > l[y];
});
int pos = 0;
while(pos < n / 2 && l[v[pos]] > 0) pos++;
ret += min(pos, n - pos);
for(int i = 0; i < pos; i++) {
int id = v[pos];
answer[id][--l[id]] = t;
}
for(int i = pos; i < n; i++) {
int id = v[pos];
answer[id][--r[id]] = t;
}
}
allocate_tickets(answer);
return ret;
}
