Submission #590687

#	Time	Username	Problem	Language	Result	Execution time	Memory
590687		Jakub_Wozniak	Potatoes and fertilizers (LMIO19_bulves)	C++14	24 / 100	270 ms	10844 KiB

bulves

#include <bits/stdc++.h>
using namespace std;
long int bezw(long int j)
{
	if(j<0) j*=-1;
	return j;
}
int main()
{
	int N;
	cin >> N;
	int A[N+1],B[N+1];
	for(int i=0;i<N;i++)
	{
		cin >> A[i] >> B[i];
	}
	
	long int nadmiar=0;
	long int wynik=0;
	for(int i=0;i<N;i++)
	{
		nadmiar+=A[i]-B[i];
		wynik+=bezw(nadmiar);
	}
	cout << wynik;
	return 0;
}

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