You are given an array of positive integers nums.

You need to choose a positive integer k. In one operation, you can decrease any element of nums by k. An element is considered eliminated once its value becomes less than or equal to $0$. To eliminate an element nums[i], it requires $\lceil$ nums[i] $/ k \rceil$ operations.

Return the minimum positive integer k such that the total number of operations required to make all elements in nums less than or equal to $0$ is at most $k^2$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^5$

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.