Submission #1289830

#TimeUsernameProblemLanguageResultExecution timeMemory
1289830hahaArt Exhibition (JOI18_art)C++20
100 / 100
131 ms15948 KiB
#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
using namespace std;
const int maxn=5e5+5;
const int MOD=1e9+7;

int n;
pair<ll,int> p[maxn];
ll sum[maxn],Max[maxn];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    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++) sum[i]=sum[i-1]+p[i].s;
    ll ans=sum[1];
    Max[1]=sum[0]+p[1].f;
    for(int i=2;i<=n;i++){
        Max[i]=max(Max[i-1],-sum[i-1]+p[i].f);
        ans=max(ans,sum[i]-p[i].f+Max[i]);
    }
    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...