2019网易秋招笔试题：瞌睡

 

#include <iostream>
using namespace std;
int a[10001] = { 0 };
bool t[10001] = { 0 };
int main()
{
	int n, k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++)
	{
		cin >> t[i];
	}
	/*begin*/
	int ans = 0;
	for (int i = 1; i <= n; i++)
	{
		if (t[i])
		{
			ans += a[i];//将1的加上
			a[i] = 0;//将加上的变为0
		}
	}
	int keep = 0;
	for (int i = 1; i <= k; i++)
	{
		keep += a[i];
	}
	int maxkeep = keep;
	for (int i = 2; i <= n - k + 1; i++)
	{
		keep = keep - a[i - 1] + a[i + k - 1];
		if (maxkeep < keep)
			maxkeep = keep;
	}
	cout << ans + maxkeep;

	return 0;
}