# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1230434 | nguyenvuminh0907 | Art Exhibition (JOI18_art) | C++20 | 107 ms | 15956 KiB |
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
const int MAX = 5e5+2;
int n;
array<int, 2> f[MAX];
int x[MAX], y[MAX];
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#define FILENAME "task"
if (fopen(FILENAME".inp", "r")){
freopen(FILENAME".inp", "r", stdin);
freopen(FILENAME".out", "w", stdout);
}
cin >> n;
for (int i = 1; i <= n; ++i){
int a, b;
cin >> a >> b;
f[i] = {a, b};
}
sort(f + 1, f + 1 + n);
for (int i = 1, ps = 0; i <= n; ++i){
y[i] = f[i][0] - ps;
ps += f[i][1];
x[i] = ps - f[i][0];
}
int ans = INT_MIN;
for (int i = 1, maxY = INT_MIN; i <= n; ++i){
maxY = max(maxY, y[i]);
ans = max(ans, x[i] + maxY);
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |