제출 #1005922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1005922		Otalp	Art Exhibition (JOI18_art)	C++14	100 / 100	389 ms	24916 KiB

art

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define pll pair<ll, ll>


pll a[500100];
ll pref[500100];

//mx = pref[r] - a[r].ff + a[l].ff - pref[l-1];


void solve(){
    int n;
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>a[i].ff>>a[i].ss;
    }
    sort(a + 1, a + 1 + n);
    for(int i=1; i<=n; i++){
        pref[i] = pref[i-1] + a[i].ss;
    }
    ll ans = 0;
    ll mx = 0;
    for(int i=1; i<=n; i++){
        mx = max(mx, -pref[i-1] + a[i].ff);
        ans = max(ans, pref[i] - a[i].ff + mx);
    }
    cout<<ans;
}

int main(){
    solve();
}

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