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>
#define f first
#define s second
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
vector<pair<int, int>> a(n+1);
for(int i=0; i<n; i++)
{
cin >> a[i].f >> a[i].s;
}
sort(a.begin(), a.end());
for(int i=1; i<n; i++)
{
a[i].s=a[i-1].s+a[i].s;
}
int ans=0, x=0;
for(int i=0; i<n; i++)
{
if (i == 0) x = max(x, a[i].f);
else x=max(x, a[i].f-a[i-1].s);
ans=max(ans, a[i].s-a[i].f+x);
}
cout << ans << endl;
}
# | 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... |