# include <bits/stdc++.h>
using namespace std;
long long n,maxx=-1e18,res,minn=1e18,g[500005];
pair<long long, long long> a[500005];
int main()
{
cin >> n;
for (long long i = 1; i <= n; i++)
{
cin >> a[i].first >> a[i].second;
}
sort(a+1,a+n+1);
for (long long i = 1; i <= n; i++)
{
g[i] = g[i-1]+a[i].second;
minn = min(minn,g[i-1]-a[i].first);
res = max(res,g[i]-a[i].first-minn);
}
cout << res;
}
# | 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... |