# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
972958 | oyber | Art Exhibition (JOI18_art) | C++14 | 149 ms | 21228 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;
int main() {
int n;
scanf("%d", &n);
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++) {
ll a, b;
scanf("%lld %lld", &a, &b);
v.push_back(make_pair(a, b));
}
sort(v.begin(), v.end());
ll score = v[0].second;
ll best_score = score;
for (int i = 1; i < n; i++) {
ll dist = v[i].first - v[i-1].first;
ll diff = v[i].second - dist;
if (score+diff > v[i].second) {
score += diff;
} else {
score = v[i].second;
}
if (score > best_score) {
best_score = score;
}
//printf("%d\n", score);
}
printf("%lld\n", best_score);
}
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... |