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 p long long
#define x first
#define y second
const int maxn=5e5+2;
pair<p,p>a[maxn];
p dp[maxn];
int main() {int n;cin>>n;for (int i=0;i<n;i++){cin>>a[i].x>>a[i].y;}sort(a,a+n);dp[0]=a[0].y;for (int i=1;i<n;i++){dp[i]=max(dp[i-1]-(a[i].x-a[i-1].x)+a[i].y,a[i].y);}cout<<*max_element(dp,dp+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... |