maximum-units-on-a-truck

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 assigned to put some amount of boxes onto one truck. You are given a 2D array <code>boxTypes</code>, where <code>boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi]</code>:

<ul>
	<li><code>numberOfBoxesi</code> is the number of boxes of type <code>i</code>.</li>
	<li><code>numberOfUnitsPerBoxi</code> is the number of units in each box of the type <code>i</code>.</li>
</ul>

You are also given an integer <code>truckSize</code>, which is the maximum number of boxes that can be put on the truck. You can choose any boxes to put on the truck as long as the number&nbsp;of boxes does not exceed <code>truckSize</code>.

Return the maximum total number of units that can be put on the truck.

&nbsp;
Example 1:

<pre>
Input: boxTypes = [[1,3],[2,2],[3,1]], truckSize = 4
Output: 8
Explanation: There are:
- 1 box of the first type that contains 3 units.
- 2 boxes of the second type that contain 2 units each.
- 3 boxes of the third type that contain 1 unit each.
You can take all the boxes of the first and second types, and one box of the third type.
The total number of units will be = (1 * 3) + (2 * 2) + (1 * 1) = 8.
</pre>

Example 2:

<pre>
Input: boxTypes = [[5,10],[2,5],[4,7],[3,9]], truckSize = 10
Output: 91
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= boxTypes.length &lt;= 1000</code></li>
	<li><code>1 &lt;= numberOfBoxesi, numberOfUnitsPerBoxi &lt;= 1000</code></li>
	<li><code>1 &lt;= truckSize &lt;= 106</code></li>
</ul>

maximumUnits

Maximum Units on a Truck

Maximum Bags With Full Capacity of Rocks

maximum-bags-with-full-capacity-of-rocks

装满石头的背包的最大数量

Greedy

Array

Sorting

请你将一些箱子装在 一辆卡车 上。给你一个二维数组 <code>boxTypes</code> ，其中 <code>boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi]</code> ：

<ul>
	<li><code>numberOfBoxesi</code> 是类型 <code>i</code> 的箱子的数量。</li>
	<li><code>numberOfUnitsPerBoxi</code> 是类型 <code>i</code> 每个箱子可以装载的单元数量。</li>
</ul>

整数 <code>truckSize</code> 表示卡车上可以装载 箱子 的 最大数量 。只要箱子数量不超过 <code>truckSize</code> ，你就可以选择任意箱子装到卡车上。

返回卡车可以装载 单元 的 最大 总数。

 

示例 1：

<pre>
输入：boxTypes = [[1,3],[2,2],[3,1]], truckSize = 4
输出：8
解释：箱子的情况如下：
- 1 个第一类的箱子，里面含 3 个单元。
- 2 个第二类的箱子，每个里面含 2 个单元。
- 3 个第三类的箱子，每个里面含 1 个单元。
可以选择第一类和第二类的所有箱子，以及第三类的一个箱子。
单元总数 = (1 * 3) + (2 * 2) + (1 * 1) = 8</pre>

示例 2：

<pre>
输入：boxTypes = [[5,10],[2,5],[4,7],[3,9]], truckSize = 10
输出：91
</pre>

 

提示：

<ul>
	<li><code>1 <= boxTypes.length <= 1000</code></li>
	<li><code>1 <= numberOfBoxesi, numberOfUnitsPerBoxi <= 1000</code></li>
	<li><code>1 <= truckSize <= 106</code></li>
</ul>