제출 #913856

#제출 시각아이디문제언어결과실행 시간메모리
913856goduadzesabaArt Exhibition (JOI18_art)C++17
100 / 100
396 ms21036 KiB
#include <bits/stdc++.h>
using namespace std;
long long n,i,l,r,mx,ans; pair<long long,long long> p[500005];
int main(){
    cin>>n;
    for (i=1; i<=n; i++)
        cin>>p[i].first>>p[i].second;
    sort(p+1,p+n+1); ans=mx=LLONG_MIN;
    for (r=1; r<=n; r++){
        p[r].second+=p[r-1].second;
        mx=max(mx,p[r].first-p[r-1].second);
        ans=max(ans,p[r].second-p[r].first+mx);
    }
    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...