제출 #1120016

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120016		vjudge1	Potatoes and fertilizers (LMIO19_bulves)	C++17	100 / 100	207 ms	19136 KiB

bulves

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define szz(r) (ll)r.size()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
using namespace std;
const int mxn=3e5+5;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;
    int a[n+1],b[n+1];
    ll d[n+1]={0};
    for(int i=1;i<=n;i++)cin>>a[i]>>b[i],d[i]=d[i-1]+a[i]-b[i];
    priority_queue<ll>pq;ll rs=0;
    for(int i=1;i<n;i++){
        if(d[i]<0)rs-=d[i],d[i]-=d[i];
        rs+=d[i];
        pq.push(d[i]);
        pq.push(d[i]);
        pq.pop();
    }
    while(!pq.empty()){
        rs -= min(d[n],pq.top());
        pq.pop();
    }cout<<rs;
}

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