Submission #1111984

#TimeUsernameProblemLanguageResultExecution timeMemory
1111984vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
168 ms24820 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair <int,int>
#define f first 
#define s second 
const int N=5e5+5;
const int INF=LONG_MAX;

int n,mx=-INF,qs[N],ans=0;
pii arr[N];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for(int i=1;i<=n;i++) cin >> arr[i].f >> arr[i].s;
    sort(arr+1,arr+1+n);
    for(int i=1;i<=n;i++) qs[i]=qs[i-1]+arr[i].s;
    for(int i=1;i<=n;i++){
        mx=max(mx,arr[i].f-qs[i-1]);
        ans=max(ans,qs[i]+mx-arr[i].f);
    }
    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...