# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433638 | SAAD | 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 <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include "tickets.h"
using namespace std;
long long find_maximum(int k, vector<vector<long long>> x) {
vector<vector<long long>> x1 = x;
long long sum = 0 , s = 0 ;
for (int i = 0; i < x.size(); i++) {
sum += x[i][0];
x1[i] = { 0 };
}
sum /= x.size();
for (int i = 0; i < x.size(); i++) {
s += abs(x[i][0]-sum);
}
allocate_tickets(x1);
return s;
}