Submission #557133

#TimeUsernameProblemLanguageResultExecution timeMemory
557133aymanrsArt Exhibition (JOI18_art)C++14
100 / 100
200 ms28548 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 m[n]; for(int i = 0;i < n;i++) { m[i] = i ? min(m[i-1], p[i] - a[i].first) : p[i] - a[i].first; } long long ans = 0; for(int i = 0;i < n;i++) ans = max(ans, p[i+1] - a[i].first - m[i]); 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...