Class Solution
java.lang.Object
g2401_2500.s2499_minimum_total_cost_to_make_arrays_unequal.Solution
2499 - Minimum Total Cost to Make Arrays Unequal.<p>Hard</p>
<p>You are given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, of equal length <code>n</code>.</p>
<p>In one operation, you can swap the values of any two indices of <code>nums1</code>. The <strong>cost</strong> of this operation is the <strong>sum</strong> of the indices.</p>
<p>Find the <strong>minimum</strong> total cost of performing the given operation <strong>any</strong> number of times such that <code>nums1[i] != nums2[i]</code> for all <code>0 <= i <= n - 1</code> after performing all the operations.</p>
<p>Return <em>the <strong>minimum total cost</strong> such that</em> <code>nums1</code> and <code>nums2</code> <em>satisfy the above condition</em>. In case it is not possible, return <code>-1</code>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums1 = [1,2,3,4,5], nums2 = [1,2,3,4,5]</p>
<p><strong>Output:</strong> 10</p>
<p><strong>Explanation:</strong> One of the ways we can perform the operations is:</p>
<ul>
<li>
<p>Swap values at indices 0 and 3, incurring cost = 0 + 3 = 3. Now, nums1 = [4,2,3,1,5]</p>
</li>
<li>
<p>Swap values at indices 1 and 2, incurring cost = 1 + 2 = 3. Now, nums1 = [4,3,2,1,5].</p>
</li>
<li>
<p>Swap values at indices 0 and 4, incurring cost = 0 + 4 = 4. Now, nums1 =[5,3,2,1,4].</p>
</li>
</ul>
<p>We can see that for each index i, nums1[i] != nums2[i]. The cost required here is 10.</p>
<p>Note that there are other ways to swap values, but it can be proven that it is not possible to obtain a cost less than 10.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums1 = [2,2,2,1,3], nums2 = [1,2,2,3,3]</p>
<p><strong>Output:</strong> 10</p>
<p><strong>Explanation:</strong> One of the ways we can perform the operations is:</p>
<ul>
<li>
<p>Swap values at indices 2 and 3, incurring cost = 2 + 3 = 5. Now, nums1 = [2,2,1,2,3].</p>
</li>
<li>
<p>Swap values at indices 1 and 4, incurring cost = 1 + 4 = 5. Now, nums1 = [2,3,1,2,2].</p>
</li>
</ul>
<p>The total cost needed here is 10, which is the minimum possible.</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> nums1 = [1,2,2], nums2 = [1,2,2]</p>
<p><strong>Output:</strong> -1</p>
<p><strong>Explanation:</strong> It can be shown that it is not possible to satisfy the given conditions irrespective of the number of operations we perform. Hence, we return -1.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>n == nums1.length == nums2.length</code></li>
<li><code>1 <= n <= 10<sup>5</sup></code></li>
<li><code>1 <= nums1[i], nums2[i] <= n</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
minimumTotalCost
public long minimumTotalCost(int[] nums1, int[] nums2)
-