Submission #541669

#TimeUsernameProblemLanguageResultExecution timeMemory
541669pokmui9909Art Exhibition (JOI18_art)C++17
100 / 100
184 ms24780 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define x first
#define y second
pair<ll, ll> A[500005];
ll S[500005];
ll N;

int main(){
    cin.tie(0) -> sync_with_stdio(false);

    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> A[i].x >> A[i].y;
    }
    sort(A + 1, A + N + 1);
    for(int i = 1; i <= N; i++){
        S[i] = S[i - 1] + A[i].y;
    }
    ll ans = 0, mv = -5e18;
    for(int i = 1; i <= N; i++){
        mv = max(mv, -S[i - 1] + A[i].x);
        ans = max(ans, S[i] - A[i].x + mv);
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...