you play video game defend city group n monster you give 0indexed integer array dist size n disti initial distance kilometer ith monster cityThe monster walk city constant speed the speed monster give integer array speed size n speedi speed ith monster kilometer minuteyou weapon fully charge eliminate single monster however weapon take minute chargethe weapon fully charge startYou lose monster reach city if monster reach city exact moment weapon fully charge count loss game end use weaponreturn maximum number monster eliminate lose n eliminate monster reach city Example 1input dist 134 speed 111output 3explanationin begin distance monster 134 you eliminate monsterafter minute distance monster X23 you eliminate second monsterafter minute distance monster XX2 you eliminate thrid monsterall 3 monster eliminatedexample 2input dist 1123 speed 1111output 1explanationin begin distance monster 1123 you eliminate monsterafter minute distance monster X012 loseyou eliminate 1 monsterexample 3input dist 324 speed 532output 1explanationin begin distance monster 324 you eliminate monsterafter minute distance monster X02 loseyou eliminate 1 monster Constraintsn distlength speedlength1 n 1051 disti speedi 105