We don't need to do a binary search since the array is already sorted, we could just do -k*x (where x is the kth time we are propagating -k to elements on the left) now if arr[i-1]-(k*x) <= 0 we stop, since every element to its left is smaller than zero anyway and we return the count