/*
ID: varunra2
LANG: C++
TASK: tickets
*/
#include <bits/stdc++.h>
using namespace std;
#include "tickets.h"
#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif
#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second
const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
int n, m;
// void allocate_tickets(VVI& x) {
// for (int i = 0; i < sz(x); i++) {
// debug(i, x[i]);
// }
// }
ll find_maximum(int k, VVI x) {
n = sz(x);
m = sz(x[0]);
debug("here");
VVI ret(n, VI(m, -1));
debug("here");
if (m == 1) {
ret = x;
sort(all(x));
ll sm1, sm2;
sm1 = 0;
sm2 = 0;
for (int i = 0; i < n / 2; i++) {
sm1 += x[i][0];
}
for (int i = n / 2; i < n; i++) {
sm2 += x[i][0];
}
trav(x, ret) x = {0};
allocate_tickets(ret);
return sm2 - sm1;
}
debug("here1");
if (k == 1) {
// sum of n/2 largest elements
// minus sum of n/2 smallest elements
ll sm = 0;
priority_queue<pair<pair<ll, ll>, pair<ll, ll>>> pq;
for (int i = 0; i < n; i++) {
ll mx, mn;
auto it = max_element(all(x[i]));
auto it2 = min_element(all(x[i]));
mn = *it2;
sm -= mn;
mx = *it;
pq.push(MP(MP(mx + mn, i), MP(it - x[i].begin(), it2 - x[i].begin())));
}
for (int times = 0; times < n / 2; times++) {
auto u = pq.top();
pq.pop();
sm += u.x.x;
ret[u.x.y][u.y.x] = 0;
}
while (!pq.empty()) {
auto u = pq.top();
pq.pop();
ret[u.x.y][u.y.y] = 0;
}
debug("here");
allocate_tickets(ret);
return sm;
}
}
// int main() {
// #ifndef ONLINE_JUDGE
// freopen("tickets.in", "r", stdin);
// freopen("tickets.out", "w", stdout);
// #endif
// cin.sync_with_stdio(0);
// cin.tie(0);
// int n, m, k;
// cin >> n >> m >> k;
// VVI vals(n, VI(m));
// for (int i = 0; i < n; i++) {
// for (int j = 0; j < m; j++) {
// cin >> vals[i][j];
// }
// }
// auto x = find_maximum(k, vals);
// debug(x);
// return 0;
// }
