제출 #522196

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
522196		blue	Potatoes and fertilizers (LMIO19_bulves)	C++17	24 / 100	270 ms	14764 KiB

bulves

#include <iostream>
#include <vector>
using namespace std;

using ll = long long;
using vll = vector<ll>;

int main()
{
	int N;
	cin >> N;

	vll A(1+N), B(1+N);
	ll totA = 0, totB = 0;
	for(int i = 1; i <= N; i++) 
	{
		cin >> A[i] >> B[i];
		totA += A[i];
		totB += B[i];
	}

	A[0] = B[0] = 0;

	ll res = 0;

	ll currA = 0, currB = 0;

	for(int b = 1; b < N; b++)
	{
		currA += A[b];
		currB += B[b];

		if(currA < currB) res += currB - currA;
		if((totA - currA) < (totB - currB)) res += (totB - currB) - (totA - currA);
	}

	cout << res << '\n';
}

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