Class Solution
java.lang.Object
g2401_2500.s2448_minimum_cost_to_make_array_equal.Solution
2448 - Minimum Cost to Make Array Equal.<p>Hard</p>
<p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the array <code>nums</code> by <code>1</code>.</li>
</ul>
<p>The cost of doing one operation on the <code>i<sup>th</sup></code> element is <code>cost[i]</code>.</p>
<p>Return <em>the <strong>minimum</strong> total cost such that all the elements of the array</em> <code>nums</code> <em>become <strong>equal</strong></em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [1,3,5,2], cost = [2,3,1,14]</p>
<p><strong>Output:</strong> 8</p>
<p><strong>Explanation:</strong> We can make all the elements equal to 2 in the following way:</p>
<ul>
<li>
<p>Increase the 0<sup>th</sup> element one time. The cost is 2.</p>
</li>
<li>
<p>Decrease the 1<sup>st</sup> element one time. The cost is 3.</p>
</li>
<li>
<p>Decrease the 2<sup>nd</sup> element three times. The cost is 1 + 1 + 1 = 3.</p>
</li>
<li>
<p>The total cost is 2 + 3 + 3 = 8. It can be shown that we cannot make the array equal with a smaller cost.</p>
</li>
</ul>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [2,2,2,2,2], cost = [4,2,8,1,3]</p>
<p><strong>Output:</strong> 0</p>
<p><strong>Explanation:</strong> All the elements are already equal, so no operations are needed.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>n == nums.length == cost.length</code></li>
<li><code>1 <= n <= 10<sup>5</sup></code></li>
<li><code>1 <= nums[i], cost[i] <= 10<sup>6</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
minCost
public long minCost(int[] nums, int[] cost)
-