class Solution {
public:
    int minimumSize(vector<int>& nums, int maxOperations) {
        int left = 1;
        int right = *max_element(nums.begin(),nums.end());
        int ans = 0;

        while(left <= right)
        {
            int y = (left + right) / 2;
            long long ops = 0;
            for(int x:nums)
            {
                ops += (x-1)/y;
            }

            if(ops <= maxOperations)
            {
                ans = y;
                right = y - 1;
            }
            else
            {
                left = y + 1;
            }
        }

        return ans;
    }
};