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 ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back
void solve() {
int n;
cin>>n;
pll a[n];
for(pll &p:a)cin>>p.fs>>p.sc;
sort(a,a+n);
ll pre[n+1];
pre[0]=0;
for(int i=1;i<=n;i++)pre[i]=pre[i-1]+a[i-1].sc;
ll x=1e18,ans=0;
for(int i=0;i<n;i++){
x=min(x,pre[i]-a[i].fs);
ans=max(ans,pre[i+1]-a[i].fs-x);
}
cout<<ans;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
}
# | 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... |