# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1049938 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 349 ms | 28624 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
for(int i=1; i<n ;i++){
b[i]=b[i-1]-a[i].f+a[i].s+a[i-1].f;
}
c[0]=a[0].f;
for(int i=1; i<n;i++){
c[i]=c[i-1]-a[i-1].f+a[i].f-a[i-1].s;
}
for(int i=1; i<n;i++){
c[i]=max(c[i-1],c[i]);
}
for(int i=0; i<n; i++){
mx=max(mx, c[i]+b[i]);
}
cout << mx;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |