Computer Science, asked by yatishreddy077, 2 months ago

dani has n cups that needs to filled with soda and each cup has a different capacity of soda that it can hold dani has a particular method of filling the cups. He choosen a certain amount, say M, and fills all cups with M liters of soda. If the cups capacity is less than M, the extra soda overflows and splatters the ground. It is given that dani waths the sum of the soda that is held in the cups to be at least L. He also wants the least amount of soda to be wasted. Your task is to tell dani the smallest value of M that allows him to meet the conditions given above. If no value of M meets the given condition, output-1.​

Answers

Answered by snehhaswani4d
0

Answer:

chhxydhf the time of the time of the time of the time of the time table

Similar questions