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 int long long
#define f first
#define s second
using namespace std;
signed main() {
int n; cin >> n;
vector<pair<int,int>> v(n+1); for(int i=0;i<n;i++) cin >> v[i].f >> v[i].s;
sort(begin(v),end(v));
for(int i=0;i<n;i++) v[i+1].s += v[i].s;
vector<int> w(n); w[0] = v[1].f-v[0].s;
for(int i=1;i<n;i++) w[i] = max(w[i-1],v[i+1].f-v[i].s);
int ans = 0; for(int i=1;i<=n;i++) ans = max(ans, w[i-1]+v[i].s-v[i].f);
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... |