# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
540352 | phathnv | Potatoes and fertilizers (LMIO19_bulves) | C++11 | 137 ms | 13144 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;
const int N = 5e5 + 10;
int n;
long long a[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
int x, y;
cin >> x >> y;
a[i] = a[i - 1] + (x - y);
}
long long ans = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] < 0) {
ans += (-a[i]);
a[i] = 0;
}
if (a[i] > a[n]) {
ans += a[i] - a[n];
a[i] = a[n];
}
}
priority_queue<int> pq;
pq.push(a[1]);
# | 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... |