# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
800123 | alvingogo | Carnival Tickets (IOI20_tickets) | C++14 | 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 <vector>
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
long long find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<int> v;
ll ret=0;
vector<vector<int> > ans(n,vector<int>(m));
for(int i=0;i<n;i++){
ans[i][0]=1;
v.push_back(x[i][0]);
}
sort(v.begin(),v.end());
for(int i=0;i<n/2;i++){
ret-=v[i];
ret+=v[i+n/2];
}
allocate_tickets(ans);
return 1;
}