Submission #237095

#TimeUsernameProblemLanguageResultExecution timeMemory
237095BinyominArt Exhibition (JOI18_art)C++14
100 / 100
819 ms25120 KiB
# include <bits/stdc++.h>
# define fi first
# define se second
# define int long long

using namespace std ;

const int N = 1e6 ;

int n, a, b, psum[N], mn = 1e18, ans;

int32_t main() {
    cin >> n ;
    vector < pair < int, int > > vc ;
    for( int i = 0 ; i < n ; i ++ ) {
        cin >> a >> b ;
        vc.push_back({a,b}) ;
    }
    sort(vc.begin(), vc.end() ) ;
    for( int i = 1 ; i <= n ; i ++ ) {
        psum[i] = psum[i-1] + vc[i-1].se ;
    }
    for( int i = 1 ; i <= n ; i ++ ) {
        mn = min( mn, psum[i-1] - vc[i-1].fi ) ;
        ans = max( ans, psum[i] - vc[i-1].fi - mn) ;
    }
    cout << ans << endl;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...