blob: 35c66bcb36d90ae53cb1add10c7cb4e6528e9f61 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
#include "leetcode.h"
class Solution {
public:
int maximumBags(vector<int> &capacity, vector<int> &rocks,
int additionalRocks) {
vector<int> count;
int n = rocks.size(), ans;
for (int i = 0; i < n; ++i)
count.push_back(capacity[i] - rocks[i]);
sort(count.begin(), count.end());
for (ans = 0; ans < n && additionalRocks >= count[ans]; ++ans)
additionalRocks -= count[ans];
return ans;
}
};
int main() {
Solution obj;
vector<int> capacity = {2, 3, 4, 5}, rocks = {1, 2, 4, 4};
cout << obj.maximumBags(capacity, rocks, 2);
}
|