# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
795401 | ttamx | Potatoes and fertilizers (LMIO19_bulves) | C++14 | 148 ms | 23096 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;
typedef long long ll;
const int N=5e5+5;
int n;
ll a[N],b[N],d[N];
ll ans;
priority_queue<ll> pq;
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n;
for(int i=1;i<=n;i++)cin >> a[i] >> b[i];
for(int i=1;i<=n;i++)d[i]=d[i-1]+a[i]-b[i];
for(int i=1;i<n;i++){
if(d[i]<0)ans-=d[i],d[i]=0;
pq.emplace(d[i]);
pq.emplace(d[i]);
ans+=pq.top()-d[i];
pq.pop();
}
ll mul=1;
while(!pq.empty()&&pq.top()>d[n]){
ans+=max(0ll,pq.top()-d[n]);
pq.pop();
}
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... |