You are given two integer arrays cost and time of equal length n, which represent the cost and duration needed to paint n distinct walls.

There are two painters available:

• A paid painter who paints the $i^{ th}$ wall in time[i] units of time for cost[i] units of money.

• A free painter who can paint any wall in $1$ unit of time at a cost of $0$, but can only work while the paid painter is actively painting a wall.

Return the minimum total cost required to paint all n walls.

Constraints:

• $1 \leq$ cost.length $\leq 500$

• cost.length $==$ time.length

• $1 \leq$ cost[i] $\leq 10^6$

• $1 \leq$ time[i] $\leq 500$

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.