#include "tickets.h"
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
#define F first
#define S second
#define PB push_back
using ll = long long;
// each vector<int> in x is sorted
long long find_maximum(int k, vector<vector<int>> x) {
/* sample interaction
int n = x.size();
int m = x[0].size();
vector<vector<int>> answer;
for (int i = 0; i < n; i++) {
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;
*/
int n = x.size();
int m = x[0].size();
vector<vector<int>> answer(n, vector<int>(m, -1));
if(m == 1) {
// subtask 1 (only a single way to pick everything)
vector<int> A;
for(int i = 0; i < n; i++) {
A.PB(x[i][0]);
answer[i][0] = 0;
}
sort(A.begin(), A.end());
ll sum = 0;
for(int a : A) {
sum += abs(a-A[n/2]);
}
allocate_tickets(answer);
return sum;
}
else if(k == 1) {
// subtask 2
ll sum = 0;
priority_queue<pair<int, int>> pq;
for(int i = 0; i < n; i++) {
answer[i][0] = 0;
sum -= x[i][0];
pq.push({x[i][0]+x[i][m-1], i});
}
for(int i = 0; i < n/2; i++) {
answer[pq.top().S][0] = -1;
answer[pq.top().S][m-1] = 0;
sum += pq.top().F;
pq.pop();
}
allocate_tickets(answer);
return sum;
}
allocate_tickets(answer);
return -1;
}
