Minimum Cost to Equalize Array - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3139. Minimum Cost to Equalize Array
Hard
50 Points
Array
Greedy
Enumeration
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 109 + 7.
Examples
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 <= 105
1 <= nums[i] <= 106
1 <= cost1 <= 106
1 <= cost2 <= 106
3139. Minimum Cost to Equalize Array
Hard
50 Points
Array
Greedy
Enumeration
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 109 + 7.
Examples
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.