This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# 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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |