| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 395506 | snasibov05 | 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>x
#include <vector>
using namespace std;
long long find_maximum(int k, vector<std::vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>> ans(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
ans[i][0] = 0;
}
vector<int> v(n);
for (int i = 0; i < n; ++i) {
v[i] = x[i][0];
}
int res = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; ++i) {
if (i < n / 2) res -= v[i];
else res += v[i];
}
allocate_tickets(ans);
return res;
}
