Submission #1,369

2022-07-27 15:49:50

cpp14

Accepted 75/75

61ms

7100 KiB

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	int n;
	cin>>n;
	vector<ll> a(n+1), b(n+1);
	for(int i=1;i<=n;++i) cin>>a[i];
	for(int i=1;i<=n;++i) cin>>b[i];
	
	ll base=accumulate(b.begin(), b.end(), 0);
	
	ll curr=0, mx=0; //max of b[i]-a[i]
	for(int i=1;i<=n;++i) {
		curr+=b[i]-a[i];
		mx=max(mx, curr);
		
		if(curr<0) curr=0;
	}
	
	cout<<(base-mx)<<"\n";
	
	return 0;
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	3ms	1684 KiB
		2	Accepted	0/0	29ms	3348 KiB
		3	Accepted	3/3	2ms	2096 KiB
		4	Accepted	4/4	2ms	2420 KiB
		5	Accepted	4/4	2ms	2436 KiB
		6	Accepted	4/4	2ms	2512 KiB
		7	Accepted	4/4	3ms	2716 KiB
		8	Accepted	3/3	3ms	2824 KiB
		9	Accepted	4/4	3ms	2976 KiB
		10	Accepted	4/4	3ms	3084 KiB
		11	Accepted	4/4	3ms	3280 KiB
		12	Accepted	5/5	3ms	3324 KiB
		13	Accepted	3/3	57ms	6212 KiB
		14	Accepted	3/3	57ms	6276 KiB
		15	Accepted	3/3	57ms	6404 KiB
		16	Accepted	3/3	59ms	6576 KiB
		17	Accepted	3/3	57ms	6580 KiB
		18	Accepted	3/3	57ms	6536 KiB
		19	Accepted	3/3	56ms	6664 KiB
		20	Accepted	3/3	59ms	6720 KiB
		21	Accepted	3/3	59ms	6776 KiB
		22	Accepted	3/3	41ms	7100 KiB
		23	Accepted	3/3	61ms	7072 KiB
		24	Accepted	3/3	57ms	7048 KiB