Submission #1290502

#TimeUsernameProblemLanguageResultExecution timeMemory
1290502ayemanArt Exhibition (JOI18_art)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h>
#define int long long int

using namespace std;

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;cin >> n;
    vector<int>a(n);
    vector<int>b(n);
    for (int i = 0; i < n; i++)cin>>a[i]>>b[i];

    vector<int> in(n);
    for (int i = 0; i < n; i++) in[i] = i;
    sort(in.begin(), in.end(), [&](int i, int j){
        return a[i] < a[j];
    });

    vector<int>pfx(n+1 , 0);
    for (int i=1;i<=n;i++)pfx[i]=pfx[i-1]+b[in[i-1]];
    int ans=LLONG_MIN,mn=pfx[0]-a[in[0]];
    for (int i=1;i<=n;i++){
        int x=(pfx[i]-a[in[i-1]])-mn;
        ans=max(x,ans);
        if(i < n){
            mn=min(mn,pfx[i]-a[in[i-1]]);
        }
    }
    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...