Submission #1282090

#TimeUsernameProblemLanguageResultExecution timeMemory
1282090xorreverseArt Exhibition (JOI18_art)C++20
100 / 100
406 ms12152 KiB
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
pair<int, int> s[500005];
int sum[500005];
signed main(){
    cin >> n;
    for (int i = 1; i <= n; i ++){
        cin >> s[i].first >> s[i].second;
    }
    sort(s + 1, s + 1 + n);
    int res = 0;
    int mn = -1e18;
    for (int i = 1; i <= n; i ++){
        sum[i] = sum[i - 1] + s[i].second;
        mn = max(mn, -sum[i - 1] + s[i].first);
        res = max(res, (sum[i] - s[i].first) + mn);

    }
    cout << res << endl;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...