# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
615514 | rsjw | Potatoes and fertilizers (LMIO19_bulves) | C++17 | 799 ms | 85368 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;
#define int long long
struct Function {
multiset<int> s;
int k, p;
Function(int a, int b) { k = a, p = b; }
void reset(int a, int b) { s.clear(), k = a, p = b; }
void prefix() {
if (k <= 0)
return;
if (s.size() < k)
assert(0);
auto it = s.end();
int c = k;
while (c--) {
it--;
k--, p += *it;
s.erase(it);
}
}
void merge(Function x) {
for (auto ele : x.s)
s.insert(ele);
k += x.k, p += x.p;
}
};
int A[500010], B[500010];
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... |