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;
typedef long long ll;
void solve(){
ll n;
cin>>n;
vector<pair<ll,ll>> v(n);
for(ll i=0;i<n;i++){
cin>>v[i].first>>v[i].second;
}
sort(v.begin(),v.end());
ll ans = 0;
for(ll i=0;i<n;i++){
ll tot = 0 , mi = 1e18, ma = 0;
for(ll j=i;j<n;j++){
tot += v[j].second;
mi = min(mi,v[j].first);
ma = max(ma,v[j].first);
ans = max(ans,tot - (ma - mi));
//cout<<i<<" "<<j<<" "<<tot<<" "<<ma<<" "<<mi<<" "<<ans<<endl;
}
}
cout<<ans<<endl;
}
int main()
{
solve();
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... |