제출 #237095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237095		Binyomin	Art Exhibition (JOI18_art)	C++14	100 / 100	819 ms	25120 KiB

art

# 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;

}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50