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>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mxN = (int)5e5+10;
int n, m, a[mxN];
pair<int,int> v[mxN];
int32_t main() {
cin >> n; int ans = 0;
for(int i = 0; i < n; i++)
cin >> v[i].fi >> v[i].se, ans = max(ans, v[i].se);
sort(v,v+n); int sum = 0; set<int> S;
for(int i = 0; i < n; i++){
sum+=v[i].se;
int cur = sum-v[i].fi;
if(!S.empty()) ans = max(ans, cur+*prev(S.end()));
S.insert(v[i].se+v[i].fi-sum);
}
cout << ans;
}
# | 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... |