#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,sse4")
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fs first
#define sc second
/*
int n = x.size();
int m = x[0].size();
std::vector<std::vector<int>> answer;
for (int i = 0; i < n; i++) {
std::vector<int> row(m);
for (int j = 0; j < m; j++) {
if (j < k) {
row[j] = j;
} else {
row[j] = -1;
}
}
answer.push_back(row);
}
allocate_tickets(answer);
return 1;
*/
const int mxn = 2022;
vector<vector<int>> ansv;
vector<int> choose[mxn];
long long find_maximum(int k, std::vector<std::vector<int>> x) {
int N = x.size();
int M = x[0].size();
int K = k;
ansv = vector<vector<int>>(N,vector<int>(M,-1));
{
vector<pair<int,pii>> v;
for(int i = 0;i<N;i++){
for(int j = 0;j<M;j++){
v.push_back(make_pair(x[i][j],pii(i,j)));
}
}
sort(v.rbegin(),v.rend());
for(int i = 0;i<N*M/2;i++){
int r = v[i].sc.fs,c = v[i].sc.sc;
choose[r].push_back(c);
}
}
ll ans = 0;
int C = 0;
for(int i = 0;i<N;i++){
vector<pii> v;
for(auto &j:choose[i]){
ansv[i][j] = C;
C = (C+1)%K;
}
}
/*
cerr<<"DEBUG: "<<endl;
for(int i = 0;i<N;i++){
for(int j =0;j<M;j++)cerr<<ansv[i][j]<<' ';cerr<<endl;
}cerr<<endl;
*/
for(int i = 0;i<N;i++){
set<int> st;
for(int j = 0;j<M;j++)st.insert(j);
for(int j = 0;j<M;j++){
if(ansv[i][j] >= 0)st.erase(ansv[i][j]),ans += x[i][j];
else ans -= x[i][j];
}
for(int j = 0;j<M;j++){
if(ansv[i][j]>=00)continue;
ansv[i][j] = *st.begin();
st.erase(st.begin());
}
}
allocate_tickets(ansv);
return ans;
}
