class Solution {
public:
int smallestDivisor(vector<int>& nums, int threshold) {
        long int sum=0;
        int right=INT_MIN;
        int res=INT_MAX;
        for(int num:nums){
            sum+=num;
            if(num>right) right=num;
        }
        int left=sum/threshold;
        if(left==0) left=1;

        while(left<right){
            int mid=left+(right-left)/2;

            int tmp=0;
            for(int num:nums){
                tmp+=num/mid+( ( num % mid == 0 ) ? 0 : 1 );
            }
            if(tmp<=threshold) {
                if(mid<res) res=mid;
                right=mid;
            }else{
                left=mid+1;
            }

        }
        return res;
    }
};