제출 #211987

#제출 시각아이디문제언어결과실행 시간메모리
211987hhh07Art Exhibition (JOI18_art)C++14
100 / 100
804 ms17400 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

int main(){
    int n;
    cin >> n;
    pair<ll, ll> a[n];
    for (int i = 0; i < n; i++)
        cin >> a[i].first >> a[i].second;
    ll s[n], m[n];
    sort(a, a + n);
    s[0] = a[0].second;
    m[0] = -a[0].first;
    for (int i = 1; i < n; i++){
        m[i] = min(m[i - 1], s[i - 1] - a[i].first);
        s[i] = s[i - 1] + a[i].second;
    }
    
    ll res = a[0].second;
    for (int i = 1; i < n; i++){
        res = max(res, s[i] - a[i].first - m[i]);
    }
    
    cout << res << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...