there bookstore owner store open n minute every minute number customer enter store you give integer array customer length n customersi number customer enter store start ith minute customer leave end minuteOn minutes bookstore owner grumpy you give binary array grumpy grumpyi 1 bookstore owner grumpy ith minute 0 otherwiseWhen bookstore owner grumpy customer minute satisfied satisfiedThe bookstore owner know secret technique grumpy minute consecutive minute use oncereturn maximum number customer satisfy day Example 1input customer 10121175 grumpy 01010101 minute 3output 16explanation the bookstore owner keep grumpy 3 minute the maximum number customer satisfy 1 1 1 1 7 5 16example 2input customer 1 grumpy 0 minute 1output 1 Constraintsn customerslength grumpylength1 minute n 2 1040 customersi 1000grumpyi 0 1