Submission #1034039

#TimeUsernameProblemLanguageResultExecution timeMemory
1034039vjudge1Art Exhibition (JOI18_art)C++17
0 / 100
0 ms348 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n; cin >> n; vector<pair<long long, long long>> q; for (int i = 0; i < n; ++i) { long long a, b; cin >> a >> b; q.push_back({a, b}); } sort(q.begin(), q.end()); long long ans = -1; long long cur = q[0].second; long long check = q[0].second; for (int i = 1; i < n; ++i) { cur += q[i].second - (q[i].first - q[0].first); if (i > 1) { cur += (q[i - 1].first - q[0].first); } ans = max(ans, cur); check = max(check, q[i].second); } cout << max(ans, max(check, 0LL)) << endl; 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...