Submission #653415

#TimeUsernameProblemLanguageResultExecution timeMemory
653415Dec0DeddArt Exhibition (JOI18_art)C++14
100 / 100
543 ms24984 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pii pair<ll, ll> const int N = 5e5+1; const ll INF = 1e18; vector<pii> v; ll pref[N], mn=INF; int main() { int n; cin>>n; for (int i=1; i<=n; ++i) { ll a, b; cin>>a>>b; v.push_back({a, b}); } sort(v.begin(), v.end()); ll ans=0; for (int i=1; i<=n; ++i) { pref[i]=pref[i-1]+v[i-1].second; mn=min(mn, pref[i-1]-v[i-1].first); ans=max(ans, pref[i]-v[i-1].first-mn); } cout<<ans<<"\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...