Submission #557130

#TimeUsernameProblemLanguageResultExecution timeMemory
557130aymanrsArt Exhibition (JOI18_art)C++14
50 / 100
1043 ms24580 KiB
#include <bits/stdc++.h> using namespace std; void solve(){ int n; cin >> n; pair<long long, long long> a[n]; long long p[n+1] = {0}; for(int i = 0;i < n;i++){ cin >> a[i].first >> a[i].second; } sort(a, a+n); for(int i = 0;i < n;i++) p[i+1] = p[i] + a[i].second; long long ans = 0; for(int i = 0;i < n;i++) for(int j = i;j < n;j++) ans = max(ans, p[j+1] - p[i] - a[j].first + a[i].first); cout << ans << '\n'; } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); int t = 1; //cin >> t; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...