aggressive_cow.cpp

class Solution {
public:

    int solve(int n, int k, vector<int> &stalls) {
    
        // Write your code here
        int start=1,end,mid,ans;
        //sort them in inc order
        sort(stalls.begin(),stalls.end());
        end=stalls[n-1]-stalls[0];
        while(start<=end)
        {
            mid=start+(end-start)/2;
            int count=1,pos=stalls[0];
            for(int i=1;i<n;i++)
            {
                if(pos+mid<=stalls[i])
                {
                    count++;
                    pos=stalls[i];
                }
                
            }
            if(count<k)
            {
                end=mid-1;
            }
            else
            {
                ans=mid;
                start=mid+1;
            }
            
        }
        return ans;
    }
};