# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64134 | keko37 | Art Exhibition (JOI18_art) | C++14 | 2 ms | 248 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<cstdio>
#include<algorithm>
using namespace std;
typedef long long llint;
const int MAXN = 500005;
llint n, sol, mx;
llint s[MAXN];
pair <llint, llint> p[MAXN];
int main () {
cin >> n;
for (int i=1; i<=n; i++) {
scanf("%lld%lld", &p[i].first, &p[i].second);
}
sort(p+1, p+n+1);
for (int i=1; i<=n; i++) {
s[i] = p[i].second + s[i-1];
}
for (int i=n; i>=1; i--) {
mx = max(mx, s[i] - p[i].first);
sol = max(sol, mx + p[i].first - s[i-1]);
}
cout << sol;
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... |