# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105249 | julian | Art Exhibition (JOI18_art) | C++98 | 1062 ms | 24624 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 <iostream>
#include <vector>
#include <algorithm>
long long sum(long long i, long long j, std::vector<long long>& PS) {
return PS[j] - (i == 0 ? 0 : PS[i - 1]);
}
int main()
{
long long N;
std::cin >> N;
std::vector<std::pair<long long, long long>> P(N);
for (auto& [a, b] : P) {
std::cin >> a >> b;
}
std::sort(P.begin(), P.end());
std::vector<long long> PSA(N);
PSA[0] = P[0].second;
for (long long i = 1; i < N; i++) {
PSA[i] = PSA[i - 1] + P[i].second;
}
long long result = 0;
for (long long i = 0; i < N; i++) {
for (long long j = i; j < N; j++) {
result = std::max(result, PSA[j] - (i == 0 ? 0 : PSA[i - 1]) - (P[j].first - P[i].first));
}
}
std::cout << result << std::endl;
}
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... |