# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
593005 | penguinhacker | Potatoes and fertilizers (LMIO19_bulves) | C++17 | 171 ms | 14944 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 ll long long
#define ar array
const int mxN=5e5;
int n, a[mxN], b[mxN];
priority_queue<ll> pq;
ll ans, shift;
void dbg() {
priority_queue<ll> pq2=pq;
vector<ll> vals;
while(pq2.size()) {
vals.push_back(pq2.top()+shift);
pq2.pop();
}
reverse(vals.begin(), vals.end());
cout << ans << "\n";
for (ll i : vals)
cout << i << " ";
cout << endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
pq.push(0);
# | 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... |