You are given an integer mountainHeight and an integer array workerTimes.

Several workers work simultaneously to reduce the height of the mountain. If worker i decides to decrease the mountain height by $x$, the time required is workerTimes[i] $ imes (1 + 2 + \dots + x)$ seconds.

Return the minimum number of seconds required to reduce the mountain height to $0$.

Constraints:

• $1 \leq$ mountainHeight $\leq 10^5$

• $1 \leq$ workerTimes.length $\leq 10^4$

• $1 \leq$ workerTimes[i] $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.