A greedy algorithm will find the optimal number of breaks each bus is required to take. For each bus in the list ~B~ sorted in descending order, calculate the difference between the estimated arrival times of the current ~B[i]~ and the next ~B[i + 1]~ bus. Then, if this difference is greater than the desired headway ~H~, we can adjust the time accordingly by adding the appropriate length of time in breaks of length ~M~, rounding up.

Time Complexity: ~\mathcal{O}(N)~