제출 #1115390

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1115390		staszic_ojuz	Art Exhibition (JOI18_art)	C++17	50 / 100	131 ms	17584 KiB

art

#include <bits/stdc++.h>

using namespace std;

using ll=long long;

const int MAX=5*1e3+7;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int n;
    cin >> n;
    
    ll a, b, cale=0, mmin=1e16, mmax=0;
    vector<pair<ll, ll>> prace;

    for (int i=0; i<n; i++){
        cin >> a >> b;
        cale += b;
        mmin = min(mmin, a);
        mmax = max(mmax, a);
        prace.push_back({a, b});
    }
    
    cale -= (mmax-mmin);

    sort(prace.begin(), prace.end());

    pair<ll, ll> pref[MAX];
    pair<ll, ll> suf[MAX];
    
    pref[0] = {0, 0};

    for (int i=1; i<n; i++){
        pref[i].first = pref[i-1].first - prace[i-1].second+(prace[i].first-prace[i-1].first);
        pref[i].second = max(pref[i].first, pref[i-1].second);
    }

    suf[n] = {0, 0};

    for (int i=n-2; i>0; i--){
        suf[i].first = suf[i+1].first - prace[i+1].second+(prace[i+1].first-prace[i].first);
        suf[i].second = max(suf[i].first, suf[i+1].second);
    }

    ll wyn=0;

    for (int i=0; i<=n; i++){
        wyn = max(wyn, pref[i].second+suf[i].second);
    }

    cout << cale+wyn << "\n";
    
    return 0;
}

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