#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define dbg(x) cerr << #x << ": " << x << endl;
ll find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>> s(n, vector<int>(m, -1));
vector<int> a(n);
iota(a.begin(), a.end(), 0);
sort(a.begin(), a.end(), [&](int lhs, int rhs) {
return x[lhs][0] < x[rhs][0];
});
for (int i = 0; i < n / 2; ++i) {
s[a[i]][0] = 0;
}
int mn = 1e9 + 5;
for (int i = n / 2; i < n; ++i) {
s[a[i]][m - 1] = 0;
mn = min(mn, x[a[i]][m - 1]);
}
ll ans = 0;
for (int i = 0; i < n / 2; ++i) {
ans += abs(x[a[i]][0] - mn);
}
for (int i = n / 2; i < n; ++i) {
ans += abs(x[a[i]][m - 1] - mn);
}
// bipartite graph?
allocate_tickets(s);
return ans;
}
// int main() {
// int n, m, k;
// cin >> n >> m >> k;
// vector<vector<int>> a(n, vector<int>(m));
// for (int i = 0; i < n; ++i) {
// for (int j = 0; j < m; ++j) {
// cin >> a[i][j];
// }
// }
// cout << find_maximum(k, a);
// }
