Minimum Cost to Make Array Equal
You are given two 0-indexed arrays nums and cost consisting each of n positive integers.
You can do the following operation any number of times:
- Increase or decrease any element of the array
numsby1.
The cost of doing one operation on the i^th element is cost[i].
Return the minimum total cost such that all the elements of the array nums become equal.
Example 1
Input
nums = [1,3,5,2], cost = [2,3,1,14]Output
8We can make all the elements equal to 2 with total cost 2 + 3 + 3 = 8, and no smaller cost is possible.
Example 2
Input
nums = [2,2,2,2,2], cost = [4,2,8,1,3]Output
0All the elements are already equal, so no operations are needed.
Constraints
- n == nums.length == cost.length
- 1 <= n <= 10^5
- 1 <= nums[i], cost[i] <= 10^6
- Test cases are generated in a way that the output doesn't exceed 2^53-1