Submission #1158617

#TimeUsernameProblemLanguageResultExecution timeMemory
1158617blickArt Exhibition (JOI18_art)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h>
#define F first
#define S second
#define ll long long
using namespace std;
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin>>n;
    vector<pair<ll, ll>> a(n);
    for(int i = 0; i < n; i++) {
        cin>>a[i].S>>a[i].F;
    }
    sort(a.rbegin(), a.rend());
    ll S=0, mn=LLONG_MAX, mx=LLONG_MIN, ans = 0;
    for(int i = 0; i < n; i++) {
        S+=a[i].S;
        mn=min(mn, a[i].F);
        mx=max(mx, a[i].F);
        ans = max(ans, S-(mx-mn));
    }
    cout<<ans<<'\n';
    
    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...