Submission #785621

#TimeUsernameProblemLanguageResultExecution timeMemory
78562112345678Art Exhibition (JOI18_art)C++17
100 / 100
176 ms20820 KiB
#include <bits/stdc++.h>

using namespace std;

#define ll long long

ll n, b=LLONG_MIN, ans;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    vector<pair<ll, ll>> v(n+1);
    for (int i=1; i<=n; i++) cin>>v[i].first>>v[i].second;
    sort(v.begin()+1, v.begin()+n+1);
    for (int i=1; i<=n; i++) v[i].second+=v[i-1].second;
    for (int i=n; i>=1; i--)
    {
        b=max(b, v[i].second-v[i].first);
        ans=max(ans, b+v[i].first-v[i-1].second);
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...