# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1050457 | noyancanturk | 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;
#define pb push_back
using lint=long long;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>>ans;
for(int i=0;i<n;i++){
answer.pb(vector<int>(m));
}
if(m==1){
vector<int>vals;
for(int i=0;i<n;i++){
val.pb(x[i][0]);
ans[i][0]=0;
}
sort(vals.begin(),vals.end());
lint res=0;
for(int i:vals){
res+=abs(i-vals[n/2]);
}
allocate_tickets(ans);
return res;
}
return -1;
}