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 fi first
#define se second
using namespace std;
const int N = 5e5 + 100;
long long n;
pair <long long, long long> art[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> art[i].fi >> art[i].se;
sort(art + 1, art + 1 + n);
long long ans = -1e18;
for (int i = 1; i <= n; i++)
{
long long sum = 0;
for (int j = i; j <= n; j++)
{
sum = sum + art[j].se;
ans = max(ans, sum - (art[j].fi - art[i].fi));
}
}
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... |