Submission #1229781

#TimeUsernameProblemLanguageResultExecution timeMemory
1229781dinhhiepArt Exhibition (JOI18_art)C++20
100 / 100
106 ms12116 KiB
#include<bits/stdc++.h> using namespace std; const int N=5e5+5; #define int long long pair<int,int>a[N]; int pr[N]; int res,maxx; signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for(int i = 1; i <= n; i++){ cin >> a[i].first >> a[i].second; } sort(a + 1,a + n + 1); for(int i=1;i<=n;i++){ pr[i]=pr[i-1] + a[i].second; maxx=max(maxx, + a[i].first - pr[i-1]); res=max(res,pr[i] + maxx - a[i].first); } cout << res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...