-
Notifications
You must be signed in to change notification settings - Fork 3
/
2279.cpp
42 lines (41 loc) · 1.19 KB
/
2279.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
class Solution {
public:
int maximumBags(vector<int>& capacity, vector<int>& rocks, int additionalRocks) {
vector<int> empty;
int count = 0;
int n = capacity.size();
for (int i = 0; i < n; ++i) {
if (capacity[i] == rocks[i]) count++;
else {
empty.push_back(capacity[i] - rocks[i]);
}
}
sort(empty.begin(), empty.end());
for (auto element : empty) {
if (element <= additionalRocks) {
additionalRocks -= element;
count++;
}
}
return count;
}
};
class Solution {
public:
int maximumBags(vector<int>& capacity, vector<int>& rocks, int additionalRocks) {
int n = capacity.size();
vector<int> left(n, 0);
for (int i = 0; i < n; ++i) {
left[i] = capacity[i] - rocks[i];
}
sort(left.begin(), left.end());
int cnt = 0;
for (int i = 0; i < n && additionalRocks > 0; ++i) {
int temp = min(left[i], additionalRocks);
left[i] -= temp;
additionalRocks -= temp;
if (left[i] == 0) cnt++;
}
return cnt;
}
};