Submission #202338

#TimeUsernameProblemLanguageResultExecution timeMemory
202338someone_aaArt Exhibition (JOI18_art)C++17
50 / 100
1063 ms18392 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; for(int i=1;i<=n;i++) { pref[i] = pref[i-1] + v[i-1].second; for(int j=1;j<=i;j++) { result = max(result, (pref[i] - pref[j-1]) - (v[i-1].first - v[j-1].first)); } } 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...