#1283
Find the Smallest Divisor Given a Threshold
specialist · 630 · lc medium +30 · verified · 65.5% accepted · 3,561 likes · top 70%
Description
Choose a positive integer divisor such that when every element of nums is divided by divisor (each quotient rounded up to the nearest integer), their total sum is at most threshold. Return the smallest such divisor.
For example, 7/3 rounds up to 3 and 10/2 = 5. A valid answer is always guaranteed.
Example 1:
Input: nums = [1,2,5,9], threshold = 6
Output: 5
Explanation: We can get a sum to 17 (1+2+5+9) if the divisor is 1.
If the divisor is 4 we can get a sum of 7 (1+1+2+3) and if the divisor is 5 the sum will be 5 (1+1+1+2).
Example 2:
Input: nums = [44,22,33,11,1], threshold = 5
Output: 44
Code
1
2
3