# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309569 | radaiosm7 | Art Exhibition (JOI18_art) | C++98 | 1 ms | 384 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;
long long i, j, n, ans;
pair<long long, long long> numbers[5005];
long long pref[5005];
int main() {
scanf("%lld", &n);
for (i=1; i <= n; i++) {
scanf("%lld%lld", &numbers[i].first, &numbers[i].second);
}
sort(numbers+1, numbers+n+1);
pref[0] = 0LL;
for (i=1; i <= n; i++) {
pref[i] = pref[i-1] + numbers[i].second;
}
ans = -100LL;
i = 1;
j = 1;
while (j <= n) {
ans = max(ans, pref[j]-pref[i-1]-numbers[j].first+numbers[i].first);
if (i == j) {
j++;
}
else if (numbers[i+1].first-numbers[i].first-numbers[i].second > numbers[j].first-numbers[j+1].first+numbers[j+1].second) {
i++;
}
else {
j++;
}
}
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... |