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;
typedef pair<ll,ll> pll;
const int MN=5e5+2;
int N,idx;
pll a[MN];
ll pfs[MN],ans=0;
int main() {
ios::sync_with_stdio(0);cin.tie(0);
cin>>N;
for(int i=1;i<=N;++i) cin>>a[i].first>>a[i].second;
sort(a+1,a+1+N);
for(int i=1;i<=N;++i) pfs[i]=pfs[i-1]+a[i].second;
for(int i=1;i<=N;++i)
ans=max(ans,pfs[i]-(a[i].first-a[1].first));
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... |