# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253411 | vioalbert | Potatoes and fertilizers (LMIO19_bulves) | C++14 | 202 ms | 19304 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;
typedef long long ll;
const ll N = 5e5+5, MAX = 3e4+5, ZERO = 3e4, INF = 1e18;
ll n, delta;
ll val[N], pref[N];
void read() {
cin >> n;
for(int i = 1; i <= n; i++) {
ll a, b; cin >> a >> b;
val[i] = a - b;
}
}
void solve() {
pref[0] = 0;
for(int i = 1; i <= n; i++) {
pref[i] = pref[i-1] + val[i];
}
delta = pref[n];
ll ans = 0, x;
priority_queue<ll> pq;
pq.push(0);
for(int i = 1; i <= n; i++) {
x = pref[i];
if(x < 0) {
ans += -x;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |