Smallest Divisor Given a Threshold

Find the smallest positive integer d such that the sum of ceil(nums[i] / d) over the array is at most threshold. Print d.

1 <= n <= 5 * 10^4 1 <= nums[i] <= 10^6 n <= threshold <= 10^6