# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66735 | ekrem | Art Exhibition (JOI18_art) | C++98 | 3 ms | 564 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 st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1000005
using namespace std;
typedef long long ll;
ll n, l, r, mx, mn, top, ans;
pair < ll , ll > a[N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%lld",&n);
for(ll i = 1; i <= n; i++)
scanf("%lld %lld",&a[i].st ,&a[i].nd);
sort(a + 1, a + n + 1);
l = r = 1;
mx = a[1].st;
mn = a[1].st;
top = a[1].nd;
ans = max(ans, top - (mx - mn));
for(r = 2; r <= n; r++){
top += a[r].nd;
mx = a[r].st;
while(l < r){
if(top - a[l].nd - (mx - a[l + 1].st) > top - (mx - mn)){
top -= a[l].nd;
l++;
mn = a[l].st;
}
else
break;
}
ans = max(ans, top - (mx - mn));
}
printf("%lld\n",ans);
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... |