Submission #713644

#	Time	Username	Problem	Language	Result	Execution time	Memory
713644		EqualTurtle	Potatoes and fertilizers (LMIO19_bulves)	C++14	100 / 100	149 ms	15320 KiB

bulves

#include <bits/stdc++.h>
using namespace std;

constexpr int MAXN = 5e5 + 7;

long long tab[MAXN];
int n;
long long res;

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n;
	priority_queue<long long> pq;

	for (int i = 1; i <= n; i++)
    {
		long long a;
        cin >> tab[i] >> a;
        tab[i] += tab[i - 1] - a;
	}

	for (int i = 1; i <= n; i++)
    {
        // modyfikacja zeby wartosci byly z przedzialu (0, #nawozow - #ziemniakow)
		if (tab[i] < 0) 
        {
			res -= tab[i];
			tab[i] = 0;
		}
		else if (tab[i] > tab[n])
        {
			res += tab[i] - tab[n];
			tab[i] = tab[n];
		}

        // a dalej klasyczna sztuczka
		pq.push(tab[i]);
		pq.push(tab[i]);
		res += pq.top() - tab[i];
		pq.pop();
	}

	cout << res << "\n";
    return 0;
}

• Subtask 1: 24 / 24
• Subtask 2: 10 / 10
• Subtask 3: 20 / 20
• Subtask 4: 10 / 10
• Subtask 5: 36 / 36