# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45128 | Pajaraja | Art Exhibition (JOI18_art) | C++17 | 421 ms | 219856 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;
pair<long long,long long> a[500007],b[500007];
int main()
{
int n,cnt=0;
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%lld%lld",&b[i].first,&b[i].second);
sort(b,b+n);
for(int i=0;i<n;i++)
{
a[cnt].first=b[i].first;
a[cnt].second+=b[i].second;
if(b[i].first!=b[i+1].first) cnt++;
}
long long sum=0,sol=-1000000000000000000LL,minn=1000000000000000000LL;
for(int i=0;i<cnt;i++)
{
minn=fmin(minn,-a[i].first+sum);
sum+=a[i].second;
sol=fmax(sol,sum-a[i].first-minn);
}
printf("%lld",sol);
}
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... |