#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
const int N = 1504;
int c[N];
long long find_maximum(int k, std::vector<std::vector<int>> x) {
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++) {
row[j] = -1;
}
answer.push_back(row);
}
long long ans = 0;
vector <pair <long long, int>> v;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
ans += x[i][m - j - 1];
v.push_back(make_pair (x[i][m - j - 1] + x[i][k - j - 1], i));
}
}
sort (v.begin(), v.end());
for (int i = 0; i < (n / 2) * k; i++) {
ans -= v[i].F;
c[v[i].S]++;
}
long long wefwef = 0;
for (int i = 0; i < n; i++ ){
for (int j = 0; j < m; j++) {
if (j < c[i]) {
wefwef -= x[i][j];
answer[i][j] = j;
} else if (j >= m - (k - c[i])) {
answer[i][j] = c[i] + j - (m - (k - c[i]));
wefwef += x[i][j];
} else
answer[i][j] = -1;
}
}
assert (wefwef == ans);
allocate_tickets(answer);
return ans;
}
