minimum-cost-to-make-array-equal

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given two 0-indexed arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> positive integers.

You can do the following operation any number of times:

<ul>
	<li>Increase or decrease any element of the array <code>nums</code> by <code>1</code>.</li>
</ul>

The cost of doing one operation on the <code>ith</code> element is <code>cost[i]</code>.

Return the minimum total cost such that all the elements of the array <code>nums</code> become equal.

&nbsp;
Example 1:

<pre>
Input: nums = [1,3,5,2], cost = [2,3,1,14]
Output: 8
Explanation: We can make all the elements equal to 2 in the following way:
- Increase the 0th element one time. The cost is 2.
- Decrease the 1st element one time. The cost is 3.
- Decrease the 2nd element three times. The cost is 1 + 1 + 1 = 3.
The total cost is 2 + 3 + 3 = 8.
It can be shown that we cannot make the array equal with a smaller cost.
</pre>

Example 2:

<pre>
Input: nums = [2,2,2,2,2], cost = [4,2,8,1,3]
Output: 0
Explanation: All the elements are already equal, so no operations are needed.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == nums.length == cost.length</code></li>
	<li><code>1 &lt;= n &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i], cost[i] &lt;= 106</code></li>
	<li>Test cases are generated in a way that the output doesn&#39;t exceed&nbsp;253-1</li>
</ul>

minCost

Minimum Cost to Make Array Equal

Minimum Moves to Equal Array Elements II

minimum-moves-to-equal-array-elements-ii

最小操作次数使数组元素相等 II

Maximum Product of the Length of Two Palindromic Substrings

maximum-product-of-the-length-of-two-palindromic-substrings

两个回文子字符串长度的最大乘积

Minimum Amount of Time to Fill Cups

minimum-amount-of-time-to-fill-cups

装满杯子需要的最短总时长

Minimum Operations to Make All Array Elements Equal

minimum-operations-to-make-all-array-elements-equal

使数组元素全部相等的最少操作次数

Minimum Cost to Make Array Equalindromic

minimum-cost-to-make-array-equalindromic

使数组成为等数数组的最小代价

Greedy

Array

Binary Search

Prefix Sum

Sorting

给你两个下标从 0&nbsp;开始的数组&nbsp;<code>nums</code> 和&nbsp;<code>cost</code>&nbsp;，分别包含&nbsp;<code>n</code>&nbsp;个&nbsp;正&nbsp;整数。

你可以执行下面操作 任意&nbsp;次：

<ul>
	<li>将&nbsp;<code>nums</code>&nbsp;中 任意&nbsp;元素增加或者减小 <code>1</code>&nbsp;。</li>
</ul>

对第 <code>i</code>&nbsp;个元素执行一次操作的开销是&nbsp;<code>cost[i]</code>&nbsp;。

请你返回使 <code>nums</code>&nbsp;中所有元素 相等&nbsp;的 最少&nbsp;总开销。

&nbsp;

示例 1：

<pre>
输入：nums = [1,3,5,2], cost = [2,3,1,14]
输出：8
解释：我们可以执行以下操作使所有元素变为 2 ：
- 增加第 0 个元素 1 次，开销为 2 。
- 减小第 1 个元素 1 次，开销为 3 。
- 减小第 2 个元素 3 次，开销为 1 + 1 + 1 = 3 。
总开销为 2 + 3 + 3 = 8 。
这是最小开销。
</pre>

示例 2：

<pre>
输入：nums = [2,2,2,2,2], cost = [4,2,8,1,3]
输出：0
解释：数组中所有元素已经全部相等，不需要执行额外的操作。
</pre>

&nbsp;

提示：

<ul>
	<li><code>n == nums.length == cost.length</code></li>
	<li><code>1 &lt;= n &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i], cost[i] &lt;= 106</code></li>
	<li>测试用例确保输出不超过 253-1。</li>
</ul>