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 sz first
#define v second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
const int MN=5e5+2;
int N;
pll a[MN];
int main() {
ios::sync_with_stdio(0);cin.tie(0);
cin>>N;
for(int i=1;i<=N;++i) cin>>a[i].sz>>a[i].v;
sort(a+1,a+1+N);
ll ans=0,tot=0,sub=0;
for(int i=1;i<=N;++i) {
sub=min(sub,tot-a[i].sz);
tot+=a[i].v;
ans=max(ans,tot-a[i].sz-sub);
}
cout<<ans<<'\n';
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... |