Submission #1033833

#TimeUsernameProblemLanguageResultExecution timeMemory
1033833vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
148 ms8284 KiB
#include<bits/stdc++.h>
#define pll pair<long long , long long>

using namespace std;

#define int long long
#define fi first
#define se second

const int inf = 1e18;

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    int n; cin>> n;
    vector<pll> a(n+1);
    for(int i = 1 ; i <= n ; i++) cin >> a[i].fi >> a[i].se;

    sort(a.begin()+1 , a.end());

    int res = -inf;
    int pre = -a[1].fi;
    int cur = 0;
    for(int i = 1; i <= n ; i++){
        cur += a[i].se;
        int t = cur - a[i].fi;
        res = max(res , t - pre);
        if(i < n){
            pre = min(pre , cur - a[i+1].fi);
        }
    }
    cout << res << "\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...