Submission #1109232

#TimeUsernameProblemLanguageResultExecution timeMemory
1109232vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
173 ms16092 KiB
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int N = 5e5+7;
struct picture {
    int a, b;
} d[N];
int n, ps[N], f[N];
bool cmp(picture x, picture y){
    if(x.a == y.a) return x.b < y.b;
    return x.a < y.a;
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n;
    for(int i = 1; i <= n; i++){
        cin>>d[i].a>>d[i].b;
    }
    sort(d+1, d+n+1, cmp);
    int res = 0;
    for(int i = 1; i <= n; i++){
        ps[i] = ps[i-1]+d[i].b;
        f[i] = max(f[i-1], d[i].a-ps[i-1]);
        res = max(ps[i]-d[i].a+f[i], res);
    }
    cout<<res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...