You are given two positive integer arrays nums and target of the same length n.

In one operation, you can choose two distinct indices i and j and perform the following actions:

• Increment nums[i] by $2$

• Decrement nums[j] by $2$

Two arrays are considered similar if both arrays contain the exact same elements with the same frequencies.

Return the minimum number of operations required to make nums similar to target.

Constraints:

• n $==$ nums.length $==$ target.length

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

• $1 \leq$ nums[i], target[i] $\leq 10^6$

• It is possible to make nums similar to target.

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.