# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1279365 | ducanh0811 | Art Exhibition (JOI18_art) | C++20 | 138 ms | 8260 KiB |
#include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define REV(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
using namespace std;
#define MAXN 500005
pair<int, int> a[MAXN];
int n;
void solve(){
cin >> n;
FOR(i, 1, n){
cin >> a[i].first >> a[i].second;
}
sort(a + 1, a + 1 + n);
int sum = 0;
int mi = -1e18;
int res = 0;
FOR(i, 1, n) {
mi = max(mi, -sum + a[i].first);
sum += a[i].second;
res = max(res, sum - a[i].first + mi);
}
cout << res;
}
#define task ""
int32_t main(){
if (fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
solve();
return 0;
}
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... |