1283. 使结果不超过阈值的最小除数

int smallestDivisor(vector<int> &nums, int threshold) {
    int l = 1, r = 1000010;
    int ret = r;
    while (l <= r) {
        int m = (l + r) >> 1;
        long long total = 0;
        for (auto it:nums)
            total += (long long) ceil((it * 1.0) / (m * 1.0));

        if (total <= threshold)
            ret = m, r = m - 1;
        else
            l = m + 1;
    }
    return ret;
}