제출 #225663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
225663		nabilervatra	Art Exhibition (JOI18_art)	C++14	100 / 100	823 ms	28792 KiB

art

#include <bits/stdc++.h>
#define fi first
#define se second

using namespace std;

long long n,suf[500005],pmax[500005],ans;
pair<long long, long long > arr[500005];
bool cmp(pair<long long, long long > a, pair<long long, long long > b){
    return a.fi>b.fi;
}
int main(){
    cin>>n;
    for(int i =1;i<=n;i++)cin>>arr[i].fi>>arr[i].se;
    sort(arr+1,arr+n+1,cmp);
    for(int i =n;i>=1;i--){
        suf[i]=suf[i+1]+arr[i].se;
    }
    pmax[0]=-1e18;
    for(int i =1;i<=n;i++){
        pmax[i] = max(pmax[i-1],suf[i]-arr[i].fi);
    }
    for(int i =n;i>=1;i--){
        ans = max(ans,arr[i].se);
        ans = max(ans,pmax[i-1]+arr[i].fi-suf[i+1]);

    }
    cout<<ans<<endl;
    
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50