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;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
#define all(x) x.begin(), x.end()
#define rep(i,a,b) for(int i = a; i < b; i++)
int main() {
int N;
cin >> N;
vpll P(N);
rep(n,0,N) {
ll a, b;
cin >> a;
cin >> b;
P[n] = make_pair(a, b);
}
sort(all(P));
rep(n,1,N) P[n].second += P[n-1].second;
vll maxMin(N);
maxMin[0] = P[0].first;
rep(n,1,N) maxMin[n] = max(maxMin[n-1], P[n].first - P[n-1].second);
ll maxHit = 0;
rep(n,0,N) maxHit = max(maxHit, maxMin[n] - P[n].first + P[n].second);
cout << maxHit << '\n';
}
# | 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... |