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;
long long ans=0;
pair<long long,long long>p[n+1];
p[0].first=0,p[0].second=0;
long long pre[n+1];
pre[0]=0;
for(int i=1;i<=n;i++)
{
cin>>p[i].first>>p[i].second;
}
sort(p,p+n+1);
for(int i=1;i<=n;i++)
pre[i]=(pre[i-1]+p[i].second);
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++)
ans=max(ans,pre[j]-pre[i-1]-p[j].first+p[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... |