Submission #554762

#TimeUsernameProblemLanguageResultExecution timeMemory
554762Rafi22Art Exhibition (JOI18_art)C++14
100 / 100
179 ms20688 KiB
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    vector<pair<ll,ll>>V(n);
    for(int i=0;i<n;i++) cin>>V[i].st>>V[i].nd;
    sort(all(V));
    ll ans=-infl,opt=V[0].st,p=0;
    for(int i=0;i<n;i++)
    {
        p+=V[i].nd;
        ans=max(ans,p-V[i].st+opt);
        if(i!=n-1) opt=max(opt,-p+V[i+1].st);
    }
    cout<<ans;


    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...