Submission #202339

#TimeUsernameProblemLanguageResultExecution timeMemory
202339someone_aaArt Exhibition (JOI18_art)C++17
100 / 100
842 ms21864 KiB
#include <bits/stdc++.h> #define ll long long #define pb push_back #define mp make_pair using namespace std; const int maxn = 500100; vector<pair<ll,ll> > v; ll pref[maxn], n; int main() { cin>>n; ll a, b; for(int i=1;i<=n;i++) { cin>>a>>b; v.pb({a, b}); } sort(v.begin(), v.end()); ll result = 0LL; ll maxv = 0LL; for(int i=1;i<=n;i++) { maxv = max(maxv, v[i-1].first - pref[i-1]); pref[i] = pref[i-1] + v[i-1].second; result = max(result, pref[i] - v[i-1].first + maxv); } cout<<result<<"\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...