# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238505 | Autoratch | Potatoes and fertilizers (LMIO19_bulves) | C++14 | 272 ms | 18444 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;
const int N = 5e5 + 1;
int n;
long long a[N],ans,s;
priority_queue<long long> q;
vector<long long> v;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
for(int i = 1;i <= n;i++)
{
int x,y;
cin >> x >> y;
a[i] = x-y+a[i-1];
}
for(int i = 1;i <= n;i++)
{
if(a[i]<0) ans+=-a[i],a[i] = 0;
if(a[i]>a[n]) ans+=a[i]-a[n],a[i] = a[n];
q.push(a[i]),q.push(a[i]),q.pop();
s+=a[i];
}
while(!q.empty()) v.push_back(q.top()),q.pop();
reverse(v.begin(),v.end());
# | 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... |