Submission #370920

#TimeUsernameProblemLanguageResultExecution timeMemory
370920FystyArt Exhibition (JOI18_art)C++17
100 / 100
559 ms21228 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define F first
#define S second
#define pb push_back
const ll INF=2e18;
int main()
{
    int n;
    cin>>n;
    vector<pll> p(n+1,{0,0});
    rep1(i,n) cin>>p[i].F>>p[i].S;
    sort(p.begin(),p.end());
    ll cur=0,tmp=0,mn=INF,ans=0;
    rep1(i,n)
    {
        cur+=p[i].S;
        tmp+=p[i-1].S;
        mn=min(mn,tmp-p[i].F);
        ans=max(ans,cur-p[i].F-mn);
    }
    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...