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>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<pair<ll, ll>> rock(n + 1); // w,v;
for (int i = 1; i <= n; i++)
{
cin >> rock[i].first >> rock[i].second;
}
rock[0] = {0, 0};
sort(rock.begin(), rock.end());
for (int i = 1; i <= n; i++)
{
rock[i].second += rock[i - 1].second;
}
ll ans = -1;
for (int l = 1; l <= n; l++)
{
for (int r = l; r <= n; r++)
{
ans = max(ans, (rock[r].second - rock[l - 1].second) - (rock[r].first - rock[l].first));
}
}
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... |