Minimum Cost to Equalize Array
You are given an integer array nums and two integers cost1 and cost2. You are allowed to perform either of the following operations any number of times:
- Choose an index
ifromnumsand increasenums[i]by1for a cost ofcost1. - Choose two different indices
i,j, fromnumsand increasenums[i]andnums[j]by1for a cost ofcost2.
Return the minimum cost required to make all elements in the array equal.
Since the answer may be very large, return it modulo 10^9 + 7.
Example 1
Input
nums = [4,1], cost1 = 5, cost2 = 2Output
15Increasing
nums[1] three times makes the array [4, 4] with a total cost of 15.Example 2
Input
nums = [2,3,3,3,5], cost1 = 2, cost2 = 1Output
6Using four two-index operations and one single-index operation makes all elements equal to 5 with a total cost of 6.
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^6
- 1 <= cost1 <= 10^6
- 1 <= cost2 <= 10^6