Given an integer array nums and an integer threshold, choose a positive integer divisor d such that the sum of each element in nums divided by d and rounded up is at most threshold.

Find the smallest positive divisor such that the sum of all rounded division results is less than or equal to threshold. Return this smallest divisor.

Note: Each division result is rounded up to the nearest integer greater than or equal to the result (i.e., its ceiling value). For example, 7 / 3 is rounded up to 3, while 10 / 2 remains 5. After rounding, all the resulting values are summed together.

Constraints:

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

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

• nums.length $\leq$ threshold $\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.