CareerCup

Cool Drink: Kenny loves Coca Cola.

- There are 'n' different shops in his colony from which he can buy coca cola.

- Each shop has different rate for the same coca cola bottle

- Kenny decided to buy his favorite cool drink for 'm' continuous days.

- Each day Kenny has 'p' money in his hand.

Find out from how many shops, Kenny can buy his favorite cool drink each day.

Prototype: Int[] find TotalShops(int input1, int[] input2 int input3, int] input4)

input1 - Total No. of shops in the colony
input2 - Rate of cool drink in each shop
input3 - No. of days, Kenny is going to buy the cool drink
input4 - Total money, Kenny has with him to buy cool drink, each day


output - No. of shops, in which, Kenny can buy cool drink, each day

Ex - input1 - 5
input2 - {3,10,8,6,11}
input3 - 4
input4 - {1,10,3,11}

output - {0,4,1,5}