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 n, b=LLONG_MIN, ans;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
vector<pair<ll, ll>> v(n+1);
for (int i=1; i<=n; i++) cin>>v[i].first>>v[i].second;
sort(v.begin()+1, v.begin()+n+1);
for (int i=1; i<=n; i++) v[i].second+=v[i-1].second;
for (int i=n; i>=1; i--)
{
b=max(b, v[i].second-v[i].first);
ans=max(ans, b+v[i].first-v[i-1].second);
}
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... |