Submission #1172788

#TimeUsernameProblemLanguageResultExecution timeMemory
1172788nguyenkhangninh99Art Exhibition (JOI18_art)C++20
100 / 100
113 ms8264 KiB


#include <bits/stdc++.h>
using namespace std;

#define int long long

void solve(){
    int n; cin >> n;

    vector<array<int, 2>> a(n + 1);

    for(int i = 1; i <= n; i++) cin >> a[i][0] >> a[i][1];
    
    sort(a.begin() + 1, a.end());
    int ans = 0, mx = 0, pref = 0;

    for(int i = 1; i <= n; i++){
       mx = max(mx, a[i][0] - pref);
       pref += a[i][1];
       ans = max(ans, mx + pref - a[i][0]);
    }
    cout << ans;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
 
    solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...