# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51954 | TadijaSebez | Art Exhibition (JOI18_art) | C++11 | 458 ms | 237048 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 <stdio.h>
#include <algorithm>
using namespace std;
#define ll long long
const int N=500050;
ll a[N],b[N],c[N],d[N];
int id[N];
bool comp(int i, int j){ return c[i]<c[j];}
const ll inf=1e18;
ll max(ll a, ll b){ return a>b?a:b;}
int main()
{
int n,i;
scanf("%i",&n);
for(i=1;i<=n;i++) scanf("%lld %lld",&c[i],&d[i]),id[i]=i;
sort(id+1,id+1+n,comp);
for(i=1;i<=n;i++) a[i]=c[id[i]],b[i]=b[i-1]+d[id[i]];
ll best=-inf,sol=-inf;
for(i=1;i<=n;i++)
{
best=max(best,a[i]-b[i-1]);
sol=max(sol,best-a[i]+b[i]);
}
printf("%lld\n",sol);
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... |