Submission #1258438

#TimeUsernameProblemLanguageResultExecution timeMemory
1258438random_nameArt Exhibition (JOI18_art)C++20
100 / 100
361 ms8312 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ll n;
    cin >> n;

    vector<pair<ll, ll>> A(n);
    for(ll i = 0; i < n; i++){
        cin >> A[i].first >> A[i].second;
    }

    sort(A.begin(), A.end(), greater<pair<ll, ll>>());

    ll max_val=0;
    ll min_prev=LONG_LONG_MAX;
    ll prev_val=0;
    for(ll i = 0; i < n; i++){
        min_prev = min(min_prev, A[i].first + prev_val);
        prev_val += A[i].second;
        max_val = max(max_val, prev_val + A[i].first - min_prev);
    }

    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...