This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// In the name of Allah. Ya ali!
#include<bits/stdc++.h>
#define double long double
typedef long long ll;
const ll MAX_N = 5e5+10;
const ll MOD = 1e9+7;
using namespace std;
pair<ll,ll> ab[MAX_N];
ll sum[MAX_N];
ll ans,n;
int main()
{
ans = -1e18;
cin >> n;
for(int i = 1;i<=n;++i)
cin >> ab[i].first >> ab[i].second;
sort(ab+1,ab+n+1);
for(int i = 1;i<=n;++i)
sum[i] = sum[i-1]+ab[i].second;
for(int i = 1;i<=n;++i)
{
for(int j = i;j<=n;++j)
{
ans = max(ans,sum[j]-sum[i-1]-ab[j].first+ab[i].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... |