제출 #1133463

#제출 시각아이디문제언어결과실행 시간메모리
1133463naneosmicArt Exhibition (JOI18_art)C++20
100 / 100
317 ms15924 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
    int n;
    cin>>n;
    vector<pair<int,int>>v(n);
    for(int i=0;i<n;i++)cin>>v[i].first>>v[i].second;
    sort(v.begin(),v.end());
    vector<pair<int,int>>pref(n);
    pref[0].first=v[0].second;
    pref[0].second=0;
    for(int i=1;i<n;i++){
        pref[i].first=pref[i-1].first+v[i].second;
        pref[i].second=pref[i-1].second+v[i-1].second;
    }
    for(int i=0;i<n;i++){
        pref[i].first-=v[i].first;
        pref[i].second-=v[i].first;
    }
    int ans=0;
    int curr=LLONG_MAX;
    for(int i=0;i<n;i++){
        curr=min(curr,pref[i].second);
        ans=max(ans,pref[i].first-curr);
    }
    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...