Submission #1049920

#TimeUsernameProblemLanguageResultExecution timeMemory
1049920vjudge1Art Exhibition (JOI18_art)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #define f first #define s second using namespace std; int main() { int n; cin >> n; pair<long long, long long> a[n];long long b[n], c[n], mx=-INT64_MAX, mj=0, mnx; for(int i=0; i<n; i++){ cin >> a[i].f >> a[i].s; } sort(a, a+n); b[0]=a[0].s-a[0].f;mx=b[0]; for(int i=1; i<n ;i++){ b[i]=b[i-1]-a[i].f+a[i].s+a[i-1].f; if(b[i]>mx){ mj=i; mx=b[i]; } } c[0]=a[0].f;mnx=c[0]; for(int i=1; i<=mj ;i++){ c[i]=c[i-1]-a[i-1].f+a[i].f-a[i-1].s; if(mnx<c[i]){ mnx=c[i]; } } cout << mx+mnx; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...