Please share your approach for Reduction Game

We were trying to remove max element and then minimizing n-1 elements by taking the max 2 elements.

Give a link for the problem.

https://drive.google.com/drive/folders/1pN-BWp-r3m8pddvS-h3KaxaqLxn75O3N

sort. then make one indice to get till numbers greater than k.
from there you had to check whether the n-2nd element would be cut by how much by preceding elements when they are subtracted. This in turn affects how the last element should be treated. Basic logical question…

Please, care to elaborate properly, in depth.

//