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 <vector>
    #include <bits/stdc++.h>
     
    using namespace std;
     
    long long find_maximum(int k, vector<vector<int>> x) {
    	int n = x.size();
    	int m = x[0].size();
    	vector<vector<int>> answer;
    	long long s=0;
    	if(m==1){
            vector<int> nums;
            for (int i = 0; i < n; i++) {
                vector<int> row(m);
                for (int j = 0; j < m; j++) {
                    row[j] = j;
                    nums.push_back(x[i][j]);
                }
                answer.push_back(row);
            }
            sort(nums.begin(),nums.end());
            for(int i=0;i<n;i++){
                if(i<n/2) s-=nums[i];
                else s+=nums[i];
            }
    	}
    	allocate_tickets(answer);
    	return s;
    }
| # | 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... |