제출 #678521

#제출 시각아이디문제언어결과실행 시간메모리
678521vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
170 ms8148 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    vector<pair<ll, ll>> a(n);
    for (int i=0; i<n; i++)
        cin >> a[i].first >> a[i].second;
    sort(a.begin(), a.end());
    ll pfs = 0;
    for (int i=0; i<n; i++)
        pfs += a[i].second;

    ll max_after = LLONG_MIN, max_val = LLONG_MIN;
    for (int i=n-1; i>=0; i--){
        max_after = max(max_after, pfs - a[i].first);
        pfs -= a[i].second;
        max_val = max(max_val, max_after + a[i].first - pfs);
    }
    cout << max_val << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...