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 ll;
#define pii pair<ll,ll>
#define f first
#define s second
const int N = 5e5+5;
int n;
pii art[N];
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> n;
for(int i = 0; i < n; i++){
cin >> art[i].f >> art[i].s;
}
sort(art, art+n);
ll ans = art[0].s, curr = art[0].s, sum = art[0].s, prev = 0;
for(int i = 1; i < n; i++){
if(sum < art[i].f-art[prev].f){
prev = i;
curr = sum = art[i].s;
} else {
sum += art[i].s;
curr = sum-(art[i].f-art[prev].f);
}
ans = max(ans, curr);
}
cout << ans << "\n";
return 0;
}
| # | 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... |