| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1300051 | opeleklanos | Carnival Tickets (IOI20_tickets) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <algorithm>
#include <vector>
#include "tickets.h"
using namespace std;
#define ll long long
ll find_maximum(int k, vector<vector<int>> x){
ll n = x.size();
ll m = x[0].size();
if(m == 1){
sort(x.begin(), x.end());
ll ans = 0;
for(ll i = 0; i<n/2; i++) ans -= x[i][0];
for(ll i = n/2; i<n; i++) ans += x[i][0];
vector<vector<ll>> arr(n, vector<ll>(1, 0));
allocate_tickets(arr);
return ans;
}
}
