# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1049869 | vjudge1 | Art Exhibition (JOI18_art) | C++98 | 0 ms | 348 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 f first
#define s second
using namespace std;
int main()
{
int n;
cin >> n;
pair<long long,long long> a[n];
for (int i = 0; i < n; i++) {
cin >> a[i].f >> a[i].s;
}
sort(a, a + n);
long long m = 0;
for (int i = 0; i < n; i++) {
long long mx = a[i].f, mn = a[i].f, r = 0;
for (int j = i; j < n; j++) {
if (a[j].f - mx < a[j].s) {
r += a[j].s - (a[j].f - mx);
if (a[j].f > mx) mx = a[j].f;
}
}
m = max(m, r);
}
cout << m;
}
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... |