Submission #1108447

#TimeUsernameProblemLanguageResultExecution timeMemory
1108447vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
124 ms13640 KiB
#include <bits/stdc++.h>
#define ll long long
#define cst const long long
#define ff first
#define ss second
using namespace std;
ll o,d,m,n,a1,a2,a3,l,r,i,j,x,y,u,v,k,w,z,M,q,p[500005],f[2000005];
cst mod=1e9+7;
pair<ll,ll> a[500005];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n;
    for(ll i=1;i<=n;i++) cin >> a[i].ff >> a[i].ss;
    sort(a+1,a+1+n);
    for(ll i=n;i>=1;i--) p[i]=p[i+1]+a[i].ss;
    for(ll i=1;i<=n;i++)
    {
        d=max(M,p[i]+a[i].ff);
        w=max(w,d-p[i+1]-a[i].ff);
        M=max(M,p[i]+a[i].ff);
    }
    cout << w;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...