Submission #1108410

#TimeUsernameProblemLanguageResultExecution timeMemory
1108410vjudge1Art Exhibition (JOI18_art)C++17
0 / 100
1 ms336 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,s,d,ans;
pair<ll,ll>a[500005];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i].first>>a[i].second;
    sort(a+1,a+n+1);
    d=0;
    for(int i=1;i<=n;i++)
    {
        s+=a[i].second;
        ans=max(ans,s-a[i].first-d);
        d=min(d,s-a[i].second-a[i].first);
    }
    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...