Submission #913881

#TimeUsernameProblemLanguageResultExecution timeMemory
913881nika7878Art Exhibition (JOI18_art)C++14
0 / 100
1 ms344 KiB
#include <bits/stdc++.h> #define f first #define s second using namespace std; int main() { int n; cin >> n; vector<pair<int, int>> a(n+1); for(int i=0; i<n; i++) { cin >> a[i].f >> a[i].s; } sort(a.begin(), a.end()); for(int i=1; i<n; i++) { a[i].s=a[i-1].s+a[i].s; } int ans=0, x=0; for(int i=0; i<n; i++) { x=max(x, a[i].f-a[i-1].s); ans=max(ans, a[i].s-a[i].f+x); } 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...