Efficient way to bin sorted array in c++

Suppose I have a sorted array of floats a[0],...,a[n-1].

I am given a number m<<n which represents the number of equispaced bins. How can I efficiently find the upper boundary of the bin that contains the most numbers?