Submission #1345577

#TimeUsernameProblemLanguageResultExecution timeMemory
1345577Faisal_SaqibPotatoes and fertilizers (LMIO19_bulves)C++20
24 / 100
42 ms4340 KiB
#include <iostream>
using namespace std;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	int a[n],b[n];
	for(int i=0;i<n;i++)
	{
		cin>>a[i]>>b[i];
	}
	long long bal=0,fnl=0;
	for(int i=0;i<n;i++)
	{
		bal+=b[i];
		bal-=a[i];
		fnl+=max(0ll,-bal);
		// cout<<bal<<' ';
	}
	for(int i=n-1;i>=0;i--)
	{
		bal+=b[i];
		bal-=a[i];
		fnl+=max(0ll,-bal);
		// cout<<bal<<' ';
	}
	
	cout<<fnl<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...