Smallest_divisor

#include<bits/stdc++.h>

 

int sumOfD(vector<int> &arr, int mid){

    int sum = 0;

    for(int i =0; i<arr.size();i++){

        sum += ceil((double)(arr[i])/ (double)(mid));

    }

    return sum;

}

 

int smallestDivisor(vector<int>& arr, int limit)

{

    int low = 1, high = *max_element(arr.begin(), arr.end());

    while( low <= high){

        int mid = (low + high)/2;

        if(sumOfD(arr, mid) <= limit){

            high = mid -1;

        }

        else {

            low = mid +1;

        }

    }

    return low;

}