Submission #1301824

#TimeUsernameProblemLanguageResultExecution timeMemory
1301824cansu_mutluArt Exhibition (JOI18_art)C++20
100 / 100
124 ms8272 KiB
#include<bits/stdc++.h> #define int long long using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n; cin >> n; vector<array<int,2>> a(n); for(int i=0;i<n;i++) cin >> a[i][0] >> a[i][1]; sort(a.begin(),a.end()); for(int i=1;i<n;i++) a[i][1]+= a[i-1][1]; int mn = 1e18,ans = 0; for(int i=0;i<n;i++) { if(i>0) mn = min(mn,-a[i][0]+a[i-1][1]); else mn = min(mn,-a[i][0]); ans = max(ans,a[i][1]-a[i][0]-mn); } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...