leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

2279.cpp (490B)

0 class Solution { 1 public: 2 int maximumBags(vector<int> &capacity, vector<int> &rocks, int additionalRocks) { 3 for (int i = 0; i < capacity.size(); i++) 4 rocks[i] = capacity[i] - rocks[i]; 5 sort(rocks.begin(), rocks.end()); 6 7 int res = 0; 8 for (int i = 0; i < capacity.size(); i++) 9 if (rocks[i] <= additionalRocks) 10 additionalRocks -= rocks[i], res++; 11 else 12 break; 13 return res; 14 } 15 };