This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector<vector<int>> x) {
  int n = x.size(), m = x[0].size();
  vector<int> ord(n), lt(n), rt(n, m - 1);
  iota(ord.begin(), ord.end(), 0);
  vector a(n, vector<int>(m, -1));
  long long res = 0;
  for (int t = 0; t < k; ++t) {
    sort(ord.begin(), ord.end(), [&](int u, int v) {
      return x[u][lt[u]] + x[u][rt[u]] < x[v][lt[v]] + x[v][rt[v]];
    });
    for (int i = 0; i < n / 2; ++i) {
      int u = ord[i];
      res -= x[u][lt[u]];
      a[u][lt[u]++] = t;
    }
    for (int i = n / 2; i < n; ++i) {
      int u = ord[i];
      res += x[u][rt[u]];
      a[u][rt[u]--] = t;
    }
  }
  allocate_tickets(a);
  return res;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |