# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433722 | SAAD | Carnival Tickets (IOI20_tickets) | C++17 | 2 ms | 688 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<int>> x) {
vector<vector<int>> x1(x.size()) ;
long long s = 0 ;
int sum = 0;
for (int i = 0; i < x.size(); i++) {
sum += x[i][0];
x1[i].push_back(0);
}
sort(x.begin(),x.end());
sum = x[x.size()/2][0] + x[x.size() / 2 - 1][0];
sum /= 2;
s = 0;
for (int i = 0; i < x.size(); i++)
s += abs(x[i][0] - sum);
allocate_tickets(x1);
return s ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |