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

In a single operation, you can select two indices i and j such that $0 \leq i, j < n$ and swap the elements nums1[i] and nums1[j]. The cost incurred by this swap is $i + j$.

You may execute this operation any number of times.

Return the minimum total cost required to make nums1[i] != nums2[i] for all $0 \leq i < n$. If it is impossible to satisfy this condition, return $-1$.

Constraints:

• n == nums1.length == nums2.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ nums1[i], nums2[i] $\leq$ n

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.