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 ll long long
ll a[500001],p[500001];
int main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
for (int i=0;i<n;i++) {
cin >> a[i] >> p[i];
}
ll mini=a[0],maxi=a[0];
ll s=p[0];
ll mx;
for (int i=1;i<n;i++) {
mx = max(p[i],max(s-maxi+mini,s-max(maxi,a[i])+min(mini,a[i])+p[i]));
if (s-max(maxi,a[i])+min(mini,a[i])+p[i] == mx) {
s+=p[i];
mini = min(mini,a[i]);
maxi = max(maxi,a[i]);
} else if (p[i] == mx){
s = p[i];
mini=a[i];
maxi=a[i];
}
}
cout << s-maxi+mini;
}
| # | 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... |