Submission #997136

#TimeUsernameProblemLanguageResultExecution timeMemory
997136Luca1234Art Exhibition (JOI18_art)C++14
100 / 100
364 ms8280 KiB
#include <bits/stdc++.h>
#define int long long

using namespace std;

pair <int, int> v[500003];

signed main()
{
    int n;
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>v[i].first>>v[i].second;
    }
    sort(v+1, v+n+1);
    long long ans=-1e15, aux=-1e15, sum=0;
    for(int i=1; i<=n; i++)
    {
        aux=max(aux, v[i].first-sum);
        sum+=v[i].second;
        ans=max(ans, sum-v[i].first+aux);
    }
    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...