# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122748 | arnold518 | Art Exhibition (JOI18_art) | C++14 | 274 ms | 26848 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;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5e5;
struct Art
{
ll a, b, d;
};
int n;
Art arr[MAXN+10];
ll ans;
int main()
{
int i, j;
scanf("%d", &n);
for(i=1; i<=n; i++) scanf("%lld%lld", &arr[i].a, &arr[i].b);
sort(arr+1, arr+n+1, [&](Art p, Art q) { return p.a<q.a; });
for(i=1; i<=n; i++) arr[i].b+=arr[i-1].b, arr[i].d=arr[i].b-arr[i].a;
vector<int> S;
for(i=n; i>=1; i--)
{
if(S.empty() || arr[S.back()].d<arr[i].d) S.push_back(i);
}
for(i=1; i<=n; i++)
{
ans=max(ans, arr[i].a+arr[S.back()].d-arr[i-1].b);
if(S.back()==i) S.pop_back();
}
printf("%lld", ans);
}
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... |