# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123120 | Hideo | Art Exhibition (JOI18_art) | C++14 | 2 ms | 256 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;
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define vl vector < ll >
#define pi pair < ll, ll >
#define pii pair < int, pi >
#define vii vector < pi >
const int N = 3e5 + 7;
const int INF = 1e9 + 7;
pi a[N];
ll pr[N];
ll rs1, rs2, mx;
int n;
int l1, r1, l2, r2;
main(){
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%lld%lld", &a[i].fr, &a[i].sc);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++)
pr[i] = pr[i - 1] + a[i].sc;
for (int i = 1; i <= n; i++){
if (mx < pr[i] - a[i].fr){
mx = pr[i] - a[i].fr;
r1 = i;
}
}
mx = 0;
for (int i = 1; i <= r1; i++){
if (mx < a[i].fr - pr[i - 1]){
mx = a[i].fr - pr[i - 1];
l1 = i;
}
}
mx = 0;
for (int i = 1; i <= n; i++){
if (mx < a[i].fr - pr[i - 1]){
mx = a[i].fr - pr[i - 1];
l2 = i;
}
}
mx = 0;
for (int i = l2; i <= n; i++){
if (mx < 1LL * pr[i] - a[i].fr){
mx = pr[i] - a[i].fr;
r2 = i;
}
}
rs1 = pr[r1] + a[l1].fr - pr[l1 - 1] - a[r1].fr;
rs2 = pr[r2] + a[l2].fr - pr[l2 - 1] - a[r2].fr;
cout << max(rs1, rs2);
}
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... |