#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;
#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)
long long find_maximum(int k, std::vector<std::vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vi> answer(n);
answer.assign(n, vector<int>(m, -1));
vii maxa, mina;
FOR(i,n){
maxa.push_back({ *min_element(x[i].begin(), x[i].end()) - *max_element(x[i].begin(), x[i].end()), i});
}
sort(maxa.begin(), maxa.end());
ll ans=0;
FOR(i,n){
int t = *min_element(x[i].begin(), x[i].end());
FOR(j,m) if(x[i][j]==t){
answer[i][j] = 0;
break;
}
ans -= t;
}
FOR(i,n/2){
int t = *max_element(x[maxa[i].S].begin(), x[maxa[i].S].end());
ans += *min_element(x[maxa[i].S].begin(), x[maxa[i].S].end());
ans += t;
FOR(j,m) answer[maxa[i].S][j] = -1;
FOR(j,m) if(x[maxa[i].S][j]==t){
answer[maxa[i].S][j] = 0;
break;
}
}
allocate_tickets(answer);
return ans;
}
