There is a bookstore owner that has a store open for n minutes. You are given an integer array customers of length n where customers[i] is the number of the customers that enter the store at the start of the i ^th minute and all those customers leave after the end of that minute.
During certain minutes, the bookstore owner is grumpy. You are given a binary array grumpy where grumpy[i] is 1 if the bookstore owner is grumpy during the i ^th minute, and is 0 otherwise.
When the bookstore owner is grumpy, the customers entering during that minute are not satisfied . Otherwise, they are satisfied.
The bookstore owner knows a secret technique to remain not grumpy for minutes consecutive minutes, but this technique can only be used once .
Return the maximum number of customers that can be satisfied throughout the day.
n == customers.length == grumpy.length1 <= minutes <= n <= 2 * 10 ^40 <= customers[i] <= 1000grumpy[i] is either 0 or 1 .