# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108539 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 122 ms | 12120 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>
using namespace std;
typedef long long ll;
const int maxN = 5e5 + 5;
pair<ll, ll> arr[maxN];
ll c[maxN];
int n;
int main()
{
if(fopen("input.txt", "r")){
freopen("input.txt", "r", stdin);
}cin.tie(NULL)->sync_with_stdio(false);
cin >> n;
for(int i = 1; i <= n; ++i){
cin >> arr[i].first >> arr[i].second;
}
sort(arr + 1, arr + n + 1);
for(int i = 1; i < n; ++i)
c[i] = arr[i].second - arr[i + 1].first + arr[i].first;
long long mi = 0, s = 0, res = arr[1].second - arr[1].first;
for(int i = 1; i < n; ++i){
s += c[i];
mi = min(mi, s);
res = max(res, arr[i + 1].second + s - mi);
}
cout << res;
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... |