Submission #1229975

#TimeUsernameProblemLanguageResultExecution timeMemory
1229975lazyboi009Art Exhibition (JOI18_art)C++20
100 / 100
109 ms12116 KiB
#include<bits/stdc++.h> using namespace std; #define int long long int const N=5e5+10; pair<int,int> a[N]; int sum[N]; signed main() { cin.tie(0)->sync_with_stdio(false); 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++){ sum[i]=sum[i-1]+a[i].second; } int ma = 0, res = 0; for(int i = 1; i <= n; i ++) { ma = max(ma, a[i].first - sum[i - 1]); res = max(res, ma + sum[i] - 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...