# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433691 | KienTranluvChaeng | Art Exhibition (JOI18_art) | C++17 | 223 ms | 20852 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
const int O = 5e5 + 5;
int n;
pair <int, int> a[O];
main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++ i) cin >> a[i].x >> a[i].y;
sort(a + 1, a + n + 1);
int Min = -a[1].x, ans = a[1].y, sum = a[1].y;
for (int i = 2; i <= n; ++ i){
ans = max(ans, sum + a[i].y - a[i].x - Min);
ans = max(ans, a[i].y);
Min = min(Min, sum - a[i].x);
sum += a[i].y;
}
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... |