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>
#define ll long long
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;cin>>n;
ll ans=LLONG_MIN;pll x[2*n+1];x[0]={0,0};
for(int i=1;i<=n;i++)cin>>x[i].f>>x[i].s;
sort(x+1,x+n+1);for(int i=1;i<=n;i++)x[i].s=x[i-1].s+x[i].s;
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
ans = max(ans,x[j].s-x[i-1].s-(x[j].f-x[i].f));
}
}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... |