# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315362 | Dymo | Art Exhibition (JOI18_art) | C++14 | 206 ms | 20984 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;
#define pb push_back
#define ll long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define endl "\n"
const ll maxn=5e5+50;
const ll mod =1e9+7;
const ll base=113;
pll a[maxn];
ll f[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (fopen("GIDDY.inp", "r"))
{
freopen("GIDDY.inp", "r", stdin);
freopen("GIDDY.out", "w", stdout) ;
}
ll n;
cin>>n ;
for (int i=1;i<=n;i++)
{
cin>>a[i].ff>>a[i].ss;
}
sort(a+1,a+n+1);
ll ans=0;
ll nw=0;
ll mx=-1e15;
for (int i=1;i<=n;i++)
{
ans=max(ans,a[i].ss);
ll pre=nw;
nw+=a[i].ss;
ans=max(ans,nw-a[i].ff+mx);
mx=max(mx,-pre+a[i].ff);
}
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... |