Hello Community! The above problem you see is a combinatorics problem, more like an algorithmic problem that I could not solve. :(
This problem requires that every child gets satisfied. In brief terms, this problem asks you to choose one number and subtract $1$ from the rest of the numbers and eventually we have to get to $0$ in all of them. We have to do this as least times as possible.
I tried hit and trial one by one but how can I guarantee to find the minimum value?
Also, if you have seen the other posts I have made in a while, it can be observed that all these problems that I am posting right now are pretty unusual combinatorics problems and I seriously need some help on how to solve these. Can anybody please suggest me some problem solving strategies for these kind of problems?
Any help would be appreciated. Thank You!