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 int long long
using namespace std;
const int N = 6e5 + 1;
int pre[N],n;
pair<int,int> a[N];
signed main()
{
cin >> n;
for(int i = 1; i <= n; i ++)
{
cin >> a[i].first >> a[i].second;
}
sort(a+1,a+n+1);
for(int i = 1; i <= n; i ++)
{
pre[i] = pre[i-1] + a[i].second;
}
int minn = 1e18,ans = -1e18;
for(int i = 1; i <= n; i++)
{
ans = max(ans,pre[i] - a[i].first - minn);
minn = min(pre[i-1]-a[i].first,minn);
}
cout << ans;
return 0;
}
# | 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... |