#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
const long long maxn=1500+10;
long long n,m,all[maxn][maxn];
vector<vector<int>>res;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
n = x.size();
m = x[0].size();
res.resize(n,vector<int>(m));
vector<long long>suma;
vector<pair<long long,long long>>allb;
for(long long i=0;i<n;i++){
for(long long j=0;j<m;j++){
all[i][j]=x[i][j];
res[i][j]=-1;
suma.push_back(all[i][j]);
}
allb.push_back(make_pair(-all[i][0]+all[i][m-1],i));
}
sort(allb.rbegin(),allb.rend());
long long mainres=0;
for(long long i=0;i<n;i++){
// cout<<i<<" "<<n/2<<" "<<suma[i]<<endl;
if(i<n/2){
mainres-=all[allb[i].second][0];
res[allb[i].second][0]=0;
}else{
mainres+=all[allb[i].second][m-1];
res[allb[i].second][m-1]=0;
}
}
allocate_tickets(res);
return mainres;
}
