Given N bags, each bag contains Bi chocolates. There is a kid and a magician. In one unit of time, kid chooses a random bag i, eats Bi chocolates, then the magician fills the ith bag with floor(Bi/2) chocolates.
Find the maximum number of chocolates that kid can eat in A units of time.
First argument is an integer A.
Second argument is an integer array B of size N.
Return an integer denoting the maximum number of chocolates that kid can eat in A units of time.
A = 3 B = [6, 5]
A = 5 b = [2, 4, 6, 8, 10]
At t = 1 kid eats 6 chocolates from bag 0, and the bag gets filled by 3 chocolates. At t = 2 kid eats 5 chocolates from bag 1, and the bag gets filled by 2 chocolates. At t = 3 kid eats 3 chocolates from bag 0, and the bag gets filled by 1 chocolate. so, total number of chocolates eaten are 6 + 5 + 3 = 14
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.