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;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n;
vector<pair<ll,ll>> v(n);
for(auto &i : v)cin >> i.first >> i.second;
sort(v.begin(), v.end());
ll ma = v[0].second;
ll cur = v[0].second;
for(int i = 1; i < n; ++i){
cur+=v[i].second;
cur-=(v[i].first-v[i-1].first);
cur = max(cur, v[i].second);
ma = max(ma,cur);
}
cout << ma << "\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... |