제출 #940239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
940239		12345678	Potatoes and fertilizers (LMIO19_bulves)	C++17	24 / 100	67 ms	18908 KiB

bulves

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=5e5+5;
ll n, a[nx], b[nx], d[nx], res;
priority_queue<ll> pq;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i]>>b[i], d[i]=d[i-1]+(a[i]-b[i]);
    for (int i=1; i<n; i++) 
    {
        if (d[i]<0) res-=d[i], d[i]=0;
        else if (d[i]>d[n]) res+=d[i]-d[n];
        //pq.push(d[i]);
        //pq.push(d[i]);
        //pq.pop();
    }
    cout<<res<<'\n';
    //while (!pq.empty()) cout<<pq.top()<<' ', pq.pop();    
}

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