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 f first
#define s second
#define pb push_back
#define mxn 500005
using namespace std;
ll n,dp[mxn],ans;
pair<ll,ll>a[mxn];
int main(){
cin >> n;
for(int i=1; i<=n; i++){
cin >> a[i].f >> a[i].s;
}
sort(a+1,a+n+1);
for(int i=1; i<=n; i++){
dp[i] = max(dp[i-1] + a[i-1].f - a[i].f + a[i].s,a[i].s);
//cout << dp[i] << " ";
ans = max(ans,dp[i]);
}
cout << ans;
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... |