# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
354358 | David_M | Art Exhibition (JOI18_art) | C++14 | 1 ms | 364 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 n, ans, Ans;
pair<ll, ll> p[500005];
int main(){
cin>>n;
for(int i=1; i<=n; i++) cin>>p[i].F>>p[i].S;
sort(p+1, p+n+1);
for(int i=1;i<=n;i++)
Ans=max(Ans, ans+p[i].S),
ans+=max((ll)0,p[i].S-p[i+1].F+p[i].F);
cout<<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... |