Submission #144666

#	Time	Username	Problem	Language	Result	Execution time	Memory
144666		brcode	Potatoes and fertilizers (LMIO19_bulves)	C++14	100 / 100	727 ms	19400 KiB

bulves

#include <iostream>
#include <queue>
using namespace std;
const long long MAXN = 5e5+5;
long long ans;
long long pref[MAXN];
long long c[MAXN];
long long n;
priority_queue<long long> pq;

int main(){

    cin>>n;
    for(long long i=1;i<=n;i++){
        long long a,b;
        cin>>a>>b;
        c[i] = a-b;
        pref[i] = pref[i-1]+c[i];
    }
    for(long long i=1;i<=n;i++){
        if(pref[i]<0){
            ans+=abs(pref[i]);
            pref[i] = 0;
        }
        if(pref[i]>pref[n]){
            ans+=pref[i]-pref[n];
            pref[i]=pref[n];
        }
    }

   
    for(long long i=1;i<=n;i++){
        if(!pq.empty() && pq.top()>pref[i]){
            ans+=pq.top()-pref[i];
            pq.pop();
            pq.push(pref[i]);
        }
        pq.push(pref[i]);
    }
    cout<<ans<<endl;
}

• Subtask 1: 24 / 24
• Subtask 2: 10 / 10
• Subtask 3: 20 / 20
• Subtask 4: 10 / 10
• Subtask 5: 36 / 36