#include "tickets.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const ll inf = 1e18+7;
const int N = 2e5+5;
long long find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
vii tmp;
for(int i=0;i<n;i++) tmp.pb(x[i][0]);
sort(all(tmp));
int m = tmp[n/2];
ll cost = 0;
for(int i=0;i<n;i++) cost += (tmp[i] - m);
vector<vii> ans;
ans.resize(n);
for(int i=0;i<n;i++){
ans[i].resize(sz(x[0]));
ans[i][0] = 0;
}allocate_tickets(ans);
return cost;
}
