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;
int main()
{
int n;
cin >> n;
vector<pair<long long,long long> > v(n+1);
for (int i=1;i<=n;i++)
cin >> v[i].first >> v[i].second;
sort(v.begin(),v.end());
long long prefsum[n+1];
prefsum[0]=0;
for (int i=1;i<=n;i++)
prefsum[i]=prefsum[i-1]+v[i].second;
long long vk=0;
for (int i=1;i<=n;i++)
{
for (int j=i;j<=n;j++)
vk=max(vk,(prefsum[j]-prefsum[i-1])-(v[j].first-v[i].first));
}
cout << vk;
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... |