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 int long long
const int N=5e5+5;
int a[N],b[N];
signed main(){
int n;
cin>>n;
int ans=0;
for(int i=0;i<n;i++)cin>>a[i]>>b[i];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
int x=a[i];
int y=a[j];
if(x>y)continue;
int s=0;
for(int l=0;l<n;l++){
if(x<=a[l] and a[l]<=y){
s+=b[l];
}
}
ans=max(ans,s-(y-x));
}
}
cout<<ans;
}
# | 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... |