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;
typedef pair<int, int> pii;
inline void solve()
{
int n;
cin >> n;
vector<pii> v(n + 1);
for (int i = 1; i <= n; ++i)
cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
vector<int> pre(n + 1);
pre[0] = 0;
for (int i = 1; i <= n; ++i)
pre[i] = pre[i - 1] + v[i].second;
int ans = 0, mx = -1e18;
for (int i = 1; i <= n; ++i)
{
mx = max(mx, v[i].first - pre[i - 1]);
ans = max(ans, pre[i] - v[i].first + mx);
}
cout << ans << '\n';
}
signed main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int tc = 1;
// cin >> tc;
while (tc--)
solve();
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... |