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;
int main(){
cin.tie(0);
cin.sync_with_stdio(0);
int N;
cin >> N;
vector<pair<long long, int>> v(N);
for(auto &i : v) cin >> i.first >> i.second;
sort(v.begin(), v.end());
vector<long long> s(N+1, 0);
for(int i=1; i<=N; i++) s[i] = s[i-1] + v[i-1].second;
long long ans = 0, maxi = 0;
for(int i=0; i<N; i++){
maxi = max(maxi, v[i].first - s[i]);
ans = max(ans, s[i+1] - v[i].first + maxi);
}
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... |