# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
460756 | mahmoudbadawy | Art Exhibition (JOI18_art) | C++17 | 257 ms | 20836 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 F first
#define S second
using namespace std;
const int N=5e5+5;
pair<long long,long long> arr[N];
int n;
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%lld %lld",&arr[i].F,&arr[i].S);
sort(arr,arr+n);
long long cur=(1LL<<60),sum=0,ans=0;
for(int i=0;i<n;i++)
{
cur=min(cur,sum-arr[i].F);
sum+=arr[i].S;
ans=max(ans,sum-arr[i].F-cur);
}
printf("%lld\n",ans);
}
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... |