#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
int m = x[0].size();
priority_queue<pair<int,int>> pq;
for (int i=0; i<n; i++) pq.push({x[i][m-1]-x[i][0], i});
vector<vector<int>> ans(n, vector<int>(m, -1));
ll res = 0;
for (int i=0; i<n/2; i++){
int cur = pq.top().second;
pq.pop();
res += x[cur][m-1];
ans[cur][m-1] = 0;
}
for (int i=0; i<n/2; i++){
int cur = pq.top().second;
pq.pop();
res -= x[cur][0];
ans[cur][0] = 0;
}
allocate_tickets(ans);
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... |