Use binary search to convert the problem into checking if we can find a specific number of consecutive robots within the budget.

Maintain a sliding window of the consecutive robots being considered.

Use either a map, deque, or heap to find the maximum charge times in the window efficiently.