# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955034 | Trisanu_Das | Carnival Tickets (IOI20_tickets) | C++17 | 0 ms | 0 KiB |
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<vector<int> > ans(n, vector<int>(m, -1));
if(k == 1){
long long sum = 0;
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >, greater<pair<long long, long long> > pq;
for(int i = 0; i < n; i++){
sum += x[i][m - 1];
pq.push({x[i][0] + x[i][m - 1], i});
}
for(int i = 0; i < n; i++){
if(i < n / 2){
sum -= pq.top().first;
ans[pq.top().second][0] = 0;
}else ans[pq.top().second][m - 1] = 0;
}
allocate_tickets(ans);
return sum;
}
}