# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157777 | ZwariowanyMarcin | Art Exhibition (JOI18_art) | C++14 | 275 ms | 24824 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.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define mp make_pair
#define pb push_back
#define ld long double
#define ss(x) (int) x.size()
#define FOR(i, j, n) for(int i = j; i <= n; ++i)
#define fi first
#define se second
#define cat(x) cerr << #x << " = " << x << endl;
#define ios cin.tie(0); ios_base::sync_with_stdio(0)
using namespace std;
const int nax = 5e5 + 11;
int n;
pair<ll, int> a[nax];
ll pref[nax];
ll best = -1e18;
ll ans = 0;
int main() {
scanf("%d", &n);
FOR(i, 1, n)
scanf("%lld %d", &a[i].fi, &a[i].se);
sort(a + 1, a + n + 1);
FOR(i, 1, n)
pref[i] = pref[i - 1] + a[i].se;
best = a[1].fi;
FOR(i, 1, n) {
ans = max(ans, pref[i] + best - a[i].fi);
best = max(best, -pref[i] + a[i + 1].fi);
}
printf("%lld", 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... |