# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
52144 | evpipis | Art Exhibition (JOI18_art) | C++14 | 341 ms | 230984 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>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;
const int len = 5e5+5;
const ll inf = 1e17;
pair<ll, ll> arr[len];
ll pref[len];
int main(){
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lld %lld", &arr[i].fi, &arr[i].se);
sort(arr+1, arr+1+n);
for (int i = 1; i <= n; i++)
pref[i] = arr[i].se + pref[i-1];
ll ans = 0, mx = -inf;
for (int i = n; i >= 1; i--){
mx = max(mx, pref[i]-arr[i].fi);
ans = max(ans, mx + arr[i].fi-pref[i-1]);
}
printf("%lld\n", ans);
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... |