제출 #836447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
836447		urieg	Potatoes and fertilizers (LMIO19_bulves)	C++17	0 / 100	1088 ms	15232 KiB

bulves

#include<bits/stdc++.h>
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define ve vector
typedef long long ll;
using namespace std;



int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;
    ll a,b ;
    priority_queue<ll>q;
    long long ans = 0;
    cin>>n;
    vector<ll>d(n);
    for(int i = 0;i<n;i++){
        cin>>a>>b;
        d[i] = a-b;
        if(i)d[i] += d[i-1];
    }

    if(d[0] < 0){
        ans += -d[0];
        d[0]=0;
    }
    q.push(d[0]);
    for(int i = 1; i<n-1; i++){
        if(d[i]<0){
            ans += -d[i];
            d[i]=0;
        }
        q.push(d[i]);
        if(q.top()>d[i]){
            ans += q.top()-d[i];
            q.push(d[i]);
            q.pop();
        }
    }
    if(n>1){
        while(q.top()>d[n-1]){
            ans += q.top()-d[n-1];
            q.pop();
        }
    }
    cout<<ans;
    return 0;
}

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