#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(v) (int)(v).size()
typedef long long ll;
const int MAXN = 1500;
int mx[MAXN], mn[MAXN];
int pai[MAXN][MAXN];
int dp[MAXN][MAXN];
int a[MAXN];
ll find_maximum(int k, vector<vector<int>> x) {
int n = sz(x);
int m = sz(x[0]);
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) {
if (x[i][j] > x[i][mx[i]]) mx[i] = j;
if (x[i][j] < x[i][mn[i]]) mn[i] = j;
}
a[i] = x[i][0];
}
ll ans = 0;
sort(a, a+n);
for (int i=0; i<n; i++) ans += abs(a[n/2] - a[i]);
vector<vector<int>> answer;
for (int i = 0; i < n; i++) {
vector<int> row(m, 1);
answer.push_back(row);
}
allocate_tickets(answer);
return ans;
}
