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