Submission #1176536

#TimeUsernameProblemLanguageResultExecution timeMemory
1176536Hamed_GhaffariArt Exhibition (JOI18_art)C++20
100 / 100
108 ms8336 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; const int MXN = 5e5+5; int n; pll a[MXN]; int32_t main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); cin >> n; for(int i=1; i<=n; i++) cin >> a[i].first >> a[i].second; sort(a+1, a+n+1); ll ans = 0, sum=0, mx=-1e18; for(int i=1; i<=n; i++) { mx = max(mx, -sum+a[i].first); sum += a[i].second; ans = max(ans, mx+sum-a[i].first); } cout << ans << '\n'; 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...