You have an array A containing N elements. Suppose you select M elements from the array , then the current beauty of the array will be sum of those M elements. Every second, the beauty of the array increases by the value M. what is the minimum amount of time, the beauty of array equals the value X. N <= 100, A[i] <= 1e5 and X <= 1e9. How do i approach this problem?