Submission #1076333

#TimeUsernameProblemLanguageResultExecution timeMemory
1076333danglayloi1Art Exhibition (JOI18_art)C++17
100 / 100
160 ms28756 KiB
#include <bits/stdc++.h> using namespace std; typedef long long chi; chi n, s[1000005], f[1000005], kq=0; pair<chi, chi> a[1000005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 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++) s[i]=s[i-1]+a[i].second; f[1]=a[1].first-s[0]; for(int i = 2; i <= n; i++) f[i]=max(f[i-1], a[i].first-s[i-1]); for(int i = 1; i <= n; i++) kq=max(kq, s[i]-a[i].first+f[i]); cout<<kq; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...