Submission #1076340

#TimeUsernameProblemLanguageResultExecution timeMemory
1076340danglayloi1Art Exhibition (JOI18_art)C++17
100 / 100
139 ms8264 KiB
#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
using ll = long long;
const ll mod=1e9+7;
const int nx=5e5+5;
int n;
ll tmp=-inf, ans=0;
pair<ll, ll> a[nx];
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n;
    for(int i = 1; i <= n; i++)
        cin>>a[i].fi>>a[i].se;
    sort(a+1, a+n+1);
    tmp=a[1].fi;
    for(int i = 1; i <= n; i++)
    {
        a[i].se+=a[i-1].se;
        tmp=max(tmp, a[i].fi-a[i-1].se);
        ans=max(ans, a[i].se-a[i].fi+tmp);
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...