Minimum Cost to Make Arrays Identical - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3424. Minimum Cost to Make Arrays Identical
Medium
30 Points
Array
Greedy
Sorting
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.
Examples
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 <= 105
0 <= k <= 2 * 1010
-105 <= arr[i] <= 105
-105 <= brr[i] <= 105
3424. Minimum Cost to Make Arrays Identical
Medium
30 Points
Array
Greedy
Sorting
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.
Examples
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.