제출 #1272516

#제출 시각아이디문제언어결과실행 시간메모리
1272516kiteyuArt Exhibition (JOI18_art)C++20
100 / 100
408 ms8240 KiB
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using ll=long long;
const int N=5e5;
pair<ll,ll>a[N+5];
int n;

int main(){
    cin>>n;
    for(int i=1;i<=n;++i)
        cin>>a[i].fi>>a[i].se;
    sort(a+1,a+1+n);
    ll ans=0;
    for(int i=1;i<=n;++i)
        ans=max(ans,a[i].se);
    ll cur=0,mn=0;
    for(int i=1;i<=n;++i){
        mn=min(mn,cur-a[i].fi);
        cur+=a[i].se;
        ll res=cur-a[i].fi;
        ans=max(ans,res-mn);
    }
    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...