Given two 0-indexed integer arrays, basket1 and basket2, representing the cost of each fruit in the basket. Each basket contains $n$ fruits. Make the two baskets identical, i.e., both arrays should have the same costs.

To achieve this, perform the following operation as many times as necessary:

1. Select two indexes, $i$ and $j$, and swap the fruit at index $i$ in basket1 with the fruit at index $j$ in basket2.

2. The cost of this swap is min(basket1[i], basket2[j]).

The two baskets are considered identical if, after sorting the fruits by cost, both baskets contain exactly the same costs.

Return the minimum cost required to make the baskets identical, or $-1$ if it is impossible.

Constraints:

• basket1.length $=$ basket2.length

• $1 \leq$ basket1.length $\leq 10^3$

• $1 \leq$ basket1[i], basket2[i] $\leq 10^4$

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.