# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81934 | mra2322001 | Art Exhibition (JOI18_art) | C++11 | 0 ms | 0 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 f0(i, n) for(int i(0); i < (n); i++)
#define f1(i, n) for(int i(1); i <= n; i++)
using namespace std;
typedef long long ll;
const int N = 500002;
struct data{
ll a, b;
operator <(data x1){
return a < x1.a;
}
} a[N];
int n; ll f[N];
int main(){
ios_base::sync_with_stdio(0);
///freopen("A.inp", "r", stdin);
cin >> n;
f1(i, n) cin >> a[i].a >> a[i].b;
sort(a + 1, a + n + 1);
ll ma = LLONG_MIN;
f1(i, n){
f[i] = a[i].b;
f[i] = max(f[i], ma + a[i].b - a[i].a);
ma = max(ma, f[i] + a[i].a);
}
cout << *max_element(f + 1, f + n + 1);
}