# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258395 | Kubin | Holiday (IOI14_holiday) | C++17 | 5046 ms | 7664 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>
using namespace std;
struct max_sum_set
{
vector<int64_t> values;
void insert(int64_t x)
{
values.push_back(x);
}
void erase(int64_t x)
{
values.erase(find(values.begin(), values.end(), x));
}
int64_t get(size_t k)
{
k = min(k, values.size());
nth_element(values.rbegin(), values.rbegin() + k, values.rend());
return accumulate(values.rbegin(), values.rbegin() + k, int64_t(0));
}
};
void divida_et_impera(
size_t d1, size_t d2, size_t p1, size_t p2,
vector<int64_t>& result, max_sum_set& V, const vector<int>& A, int mv)
{
if(d1 >= d2)
# | 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... |