Minimum Cost to Equalize Array
You are given an integer array nums and two integers cost1 and cost2.
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:
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 = 2
Output: 15
Explanation: The following operations can be performed to make the values equal: The total cost is 15.
Example 2
Input: nums = [2,3,3,3,5], cost1 = 2, cost2 = 1
Output: 6
Explanation: The following operations can be performed to make the values equal: The total cost is 6.
Example 3
Input: nums = [3,5,3], cost1 = 1, cost2 = 3
Output: 4
Explanation: The following operations can be performed to make the values equal: The total cost is 4.
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^6
- 1 <= cost1 <= 10^6
- 1 <= cost2 <= 10^6
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.