# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438102 | ToroTN | Art Exhibition (JOI18_art) | C++14 | 1 ms | 204 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;
long long n,u_i,v_i,a[500005],mx=-1e18;
vector<pair<long long,long long> > v;
int main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld %lld",&u_i,&v_i);
v.push_back(make_pair(u_i,v_i));
}
v.push_back(make_pair(-1e18,-1e18));
sort(v.begin(),v.end());
a[1]=v[1].second;
mx=a[1];
for(int i=2;i<=n;i++)
{
a[i]=max((long long)0,a[i-1]+v[i].second+v[i-1].first-v[i].first);
mx=max(mx,a[i]);
}
printf("%lld\n",mx);
}
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... |