Submission #201916

#TimeUsernameProblemLanguageResultExecution timeMemory
201916SrpskiRatnikArt Exhibition (JOI18_art)C++14
50 / 100
1014 ms24704 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; pair<ll,ll> pr[n]; for(int i = 0; i < n; i++) { cin >> pr[i].first >> pr[i].second; } sort(pr,pr+n); ll pref[n+1]; pref[0] = 0; for(int i = 0; i <= n; i++) { pref[i+1] = pref[i] + pr[i].second; } ll best = 0; for(int i = 0; i < n; i++) { for(int j = i; j < n; j++) { best = max(best, (pref[j+1] - pref[i]) - (pr[j].first - pr[i].first)); } } cout << best; } /* 3 2 3 11 2 4 5 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...