# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
354363 | David_M | Art Exhibition (JOI18_art) | C++14 | 556 ms | 8316 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
#define ll long long
using namespace std;
ll i,n,a,A;
pair<ll,ll>p[500005];
int main(){
cin>>n;
for(i=1;i<=n;i++)cin>>p[i].F>>p[i].S;
sort(p+1,p+n+1);
for(i=1;i<=n;i++)
A=max(A,a+p[i].S),
a+=p[i].F+p[i].S-p[i+1].F,a*=(a>0);
cout<<A;
}
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... |