Submission #98734

#TimeUsernameProblemLanguageResultExecution timeMemory
98734janchomathArt Exhibition (JOI18_art)C++14
100 / 100
746 ms24952 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...