Submission #632688

#	Time	Username	Problem	Language	Result	Execution time	Memory
632688		anjamilicevic	Art Exhibition (JOI18_art)	C++14	100 / 100	192 ms	24780 KiB

art

#include <bits/stdc++.h>
#define IOS {ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#define MAXN 500005

using namespace std;

pair<long long, long long> a[MAXN];
long long suf[MAXN];

void solve()
{
    int n;
    cin >> n;

    for(int i=0; i<n; i++)
    {
        cin >> a[i].first >> a[i].second ;
    }

    sort(a,a+n);
    suf[n-1]=a[n-1].first;
    long long sum=0;

    for(int i=n-2; i>=0; i--)
    {
        sum+=a[i+1].second;
        suf[i]=a[i].first+sum;
        suf[i]=min(suf[i], suf[i+1]);
    }

    sum+=a[0].second;
    long long ans=0, prev=0;

    for(int i=0; i<n; i++)
    {
        ans=max(ans, sum-prev-suf[i]+a[i].first);
        prev+=a[i].second;
    }

    cout << ans << endl;
}

int main()
{
    IOS ;

    solve() ;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50