Submission #227375

#TimeUsernameProblemLanguageResultExecution timeMemory
227375NaynaArt Exhibition (JOI18_art)C++14
100 / 100
818 ms24952 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int mxn = 5e5+5; typedef pair<ll,ll>pii; pii arr[mxn]; ll pre[mxn]; int main() { ll n; cin >> n; for(int i = 1; i <= n; i++) { cin >> arr[i].first >> arr[i].second; } sort(arr+1, arr+n+1); for(int i = 1; i <= n; i++) pre[i] = pre[i-1]+arr[i].second; ll ans = -4e18, mn = 4e18; for(int i = 1; i <= n; i++) { ll x = pre[i-1]-arr[i].first; mn = min(x, mn); ll y = pre[i]-arr[i].first; ans = max(ans, y-mn); } 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...