Submission #1334407

#TimeUsernameProblemLanguageResultExecution timeMemory
1334407justin271828Art Exhibition (JOI18_art)C++20
100 / 100
426 ms8228 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ii pair<int, int>
#define f first
#define s second

int32_t main() {
    int N;
    cin >> N;
    ii arr[N];
    for (int i = 0; i < N; i++) cin >> arr[i].f >> arr[i].s;
    sort(arr, arr+N);
    int mini = arr[0].f;
    int pref = arr[0].s;
    int maxi = pref-arr[0].f;
    int ans = arr[0].s;
    for (int i = 1; i < N; i++) {
        mini = max(mini, arr[i].f-pref);
        pref += arr[i].s;
        maxi = pref-arr[i].f;
        ans = max(ans, maxi+mini);
    }
    cout << ans;
    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...