Submission #782529

#TimeUsernameProblemLanguageResultExecution timeMemory
782529acatmeowmeowArt Exhibition (JOI18_art)C++11
100 / 100
161 ms24772 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<pair<int, int>> arr(n + 5); for (int i = 1; i <= n; i++) cin >> arr[i].first >> arr[i].second; sort(arr.begin() + 1, arr.begin() + n + 1); vector<int> prefix(n +5 ); for (int i = 1; i <= n; i++) prefix[i] = arr[i].second + prefix[i - 1]; int mx = -1e18; int ans = -1e18; for (int i = 1; i <= n; i++) { mx = max(mx, -prefix[i - 1] + arr[i].first); ans = max(ans, prefix[i] - arr[i].first + mx); } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...