Submission #229527

#TimeUsernameProblemLanguageResultExecution timeMemory
229527nickmet2004Art Exhibition (JOI18_art)C++11
0 / 100
5 ms384 KiB
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second

using namespace std;

const int N = 5e5 + 5;

int n;
pair<ll , ll> p[N];
long long pr[N];

int main (){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    for(int i = 0; i < n; ++i) cin >> p[i].f >> p[i].s;
    sort(p , p + n);
    for(int i = n - 1; i >= 0; --i){
        pr[i] = pr[i + 1] + p[i].s;
    }
    long long MN = 1e18;
    long long MX = -1e18;
    for(int i = n - 2; i >= 0; --i){
        MN = min(MN , pr[i + 1] + p[i].f);
        MX = max(MX , pr[i] - MN + p[i].f);
    }
    cout << MX << endl;
return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...