# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41578 | szawinis | Art Exhibition (JOI18_art) | C++14 | 341 ms | 16700 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;
using ll = long long;
const int N = 5e5+1;
int n;
pair<ll, ll> vec[N];
priority_queue<ll, vector<ll>, greater<ll> > pq;
ll ans, sum[N];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
ll a, b;
scanf("%lld %lld", &a, &b);
vec[i] = {a, b};
}
sort(vec+1, vec+n+1);
for(int i = 1; i <= n; i++) sum[i] = sum[i-1] + vec[i].second;
for(int i = 1; i <= n; i++) {
pq.push(sum[i-1] - vec[i].first);
ans = max(sum[i] - vec[i].first - pq.top(), ans);
}
printf("%lld", ans);
}
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... |