You are given two $0$ indexed integer arrays chargeTimes and runningCosts, both of length $n$, and an integer budget. There are $n$ robots, where the $i$-th robot has a charge time of chargeTimes[i] and a running cost of runningCosts[i].

You want to run a contiguous sequence of $k$ robots. The total cost of running $k$ consecutive robots from index $l$ to index $r$ (where $k = r - l + 1$) is defined as:

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.