mediumArrayGreedySorting 0 views
Minimum Cost to Make Arrays Identical
You are given two integer arrays arr and brr of length n, and an integer k.
You are given two integer arrays arr and brr of length n, and an integer k. You can perform the following operations on arr any number of times:
Return the minimum total cost to make arr equal to brr.
Example 1
Input: arr = [-7,9,5], brr = [7,-2,-5], k = 2
Output: 13
Explanation: The total cost to make the arrays equal is 2 + 2 + 7 + 2 = 13 .
Example 2
Input: arr = [2,1], brr = [2,1], k = 0
Output: 0
Explanation: Since the arrays are already equal, no operations are needed, and the total cost is 0.
Constraints
- 1 <= arr.length == brr.length <= 10^5
- 0 <= k <= 2 * 1010
- -10^5 <= arr[i] <= 10^5
- -10^5 <= brr[i] <= 10^5
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.