| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 301058 | Nucleist | 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 <bits/stdc++.h>
#define sz(x) x.size()
#define ll long long
#define ve vector<ll>
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
long long find_maximum(ll k,vector<vector<ll>> x) {
ll n=sz(x);
ve cur;
for (ll i = 0; i < n; ++i)
{
cur.pb(x[i][0]);
}
sort(all(cur));
ll in=cur[n/2];
ll ans=0;
for(auto it:cur){
ans+=abs(it-in);
}
vector<vector<int>>ani;
ani.resize(n);
for (ll i = 0; i < n; ++i)
{
ani[i].pb(0);
}
allocate_tickets(ani);
return ans;
}