You are given two integer arrays nums1 and nums2, both of length n.

You can perform the following operations any number of times in any order:

• Swap any two elements within the same array at a cost of $0$.

• Swap an element nums1[i] with an element nums2[j] at a cost of $1$.

Return the minimum total cost required to make nums1 and nums2 identical. If it is impossible to make the two arrays identical, return $-1$.

Constraints:

• $2 \leq n ==$ nums1.length $==$ nums2.length $\leq 8 imes 10^4$

• $1 \leq$ nums1[i], nums2[i] $\leq 8 imes 10^4$

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.