You are given two $0$ indexed integer arrays present and future of length n, where present[i] is the current price of the $i^{ ext{th}}$ stock and future[i] is the anticipated future price of the $i^{ ext{th}}$ stock. You are also given an integer budget.

You may buy each stock at most once, and the total cost to buy the chosen stocks cannot exceed budget.

Return the maximum profit that can be achieved.

Constraints:

• n $==$ present.length $==$ future.length

• $1 \leq$ n $\leq 1000$

• $0 \leq$ present[i], future[i] $\leq 100$

• $0 \leq$ budget $\leq 1000$

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.