Submission #586790

#TimeUsernameProblemLanguageResultExecution timeMemory
586790VanillaArt Exhibition (JOI18_art)C++17
100 / 100
513 ms12056 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...