# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99568 | lovemathboy | Art Exhibition (JOI18_art) | C++14 | 285 ms | 21064 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;
int n;
vector<pair<long long, int> > a;
int main() {
scanf("%d", &n);
long long i1;
int i2;
for (int i = 0; i < n; i++) {
scanf("%lld %d", &i1, &i2);
a.emplace_back(i1, i2);
}
sort(a.begin(), a.end());
long long maxi = 0, sum = 0, ans = 0;
for (int i = 0; i < n; i++) {
maxi = max(maxi, a[i].first - sum);
sum += a[i].second;
ans = max(ans, sum - a[i].first + maxi);
}
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... |