# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034040 | 2024-07-25T08:59:10 Z | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h> #define endl "\n" using namespace std; #define ll long long #define S second #define F first int main() { int n; scanf("%d", &n); vector<pair<ll, ll> > q; for(int i = 0; i < n; ++i) { ll a, b; scanf("%lld %lld", &a, &b); q.push_back({a, b}); } sort(q.begin(), q.end()); ll ans = -1; ll cur = q[0].S; ll check = q[0].S; for(int i = 1; i < n; ++i) { cur += q[i].S - (q[i].F - q[0].F); if(i > 1){ cur += (q[i - 1].F - q[0].F); } ans = max(ans, cur); check = max(check, q[i].S); } printf("%lld", max(ans, max(check, (ll)0))); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |