# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
896535 | piotrkkskalisz | Potatoes and fertilizers (LMIO19_bulves) | C++14 | 25 ms | 2776 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 <iostream>
#include <queue>
#include <vector>
#include <stack>
using namespace std;
const int M = 1e5 + 10;
long long pref[M];
long long f0;
priority_queue <long long> P;
stack <long long> stos;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, nawoz, ziemniak;
cin >> n;
pref[0] = 0;
for (int i = 1; i <= n; i++)
{
cin >> nawoz >> ziemniak;
pref[i] = pref[i - 1] + nawoz - ziemniak;
}
f0 = abs(pref[1]);
if (pref[1] < 0) P.push(0);
# | 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... |