add: 220701

This commit is contained in:
Eat-Swap 2022-07-02 01:05:59 +08:00
parent 5ff73e9efa
commit e5dcce6b8d
Signed by: Eatswap
GPG Key ID: BE661106A1F3FA0B
1 changed files with 28 additions and 0 deletions

28
cpp/2207/220701.cpp Normal file
View File

@ -0,0 +1,28 @@
#include <vector>
#include <algorithm>
/**
* 1710. Maximum Units on a Truck
* You are assigned to put some amount of boxes onto one truck. You are given a 2D array boxTypes, where boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi]:
* numberOfBoxesi is the number of boxes of type i.
* numberOfUnitsPerBoxi is the number of units in each box of the type i.
* You are also given an integer truckSize, 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 of boxes does not exceed truckSize.
* Return the maximum total number of units that can be put on the truck.
*/
class Solution {
public:
int maximumUnits(std::vector<std::vector<int>>& boxTypes, int truckSize) {
std::sort(boxTypes.begin(), boxTypes.end(), [](const auto& x, const auto& y) {
return x[1] > y[1];
});
int ans = 0;
for (const auto& i : boxTypes) {
ans += i[1] * std::min(truckSize, i[0]);
truckSize -= i[0];
if (truckSize <= 0)
break;
}
return ans;
}
};