Submission #795401

#TimeUsernameProblemLanguageResultExecution timeMemory
795401ttamxPotatoes and fertilizers (LMIO19_bulves)C++14
100 / 100
148 ms23096 KiB
#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();
    }
    cout << ans;
}

Compilation message (stderr)

bulves.cpp: In function 'int main()':
bulves.cpp:26:8: warning: unused variable 'mul' [-Wunused-variable]
   26 |     ll mul=1;
      |        ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...