# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303587 | medmdg | 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 <bits/stdc++.h>
#include "tickets.h"
using namespace std;
int fin(vector<vector<int> > a,int n,int m,int k){
int ans=0;
for(int i=0;i<n;i++){
int mid=0;
for(int j=0;j<m;j++){
mid+=a[i][j];
}
mid/=m;
int ff=0;
for(int j=0;j<m;j++){
if(abs(ff-mid)>abs(a[i][j]-mid){
ff=a[i][j];
}
}
for(int j=0;j<m;j++){
ans+=abs(ff-a[i][j]);
}
}
return ans;
}
long long int find_maximum(int k, vector<vector<int> > x){
int n=x.size();
int m=x[0].size();
if(m==1){
vector<vector<int> > ans(n);
vector<vector<int> > answ(k);
for(int i=0;i<n;i++){
ans[i].push_back(0);
ans[0].push_back(x[i][0]);
}
bool h= allocate_tickets(ans);
return fin(answ,n,m,k);
}
}