You are given two integer arrays costs and capacity, both of length n, and an integer budget.

You may choose at most $2$ distinct machines such that the sum of their costs is strictly less than budget.

Return the maximum total capacity that can be obtained. If no machines can be selected, return $0$.

Constraints:

• $1 \leq n =$ costs.length $=$ capacity.length $\leq 10^5$

• $1 \leq$ costs[i], capacity[i] $\leq 10^5$

• $1 \leq$ budget $\leq 2 imes 10^5$

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.