put-boxes-into-the-warehouse-i.cpp

// Time:  O(nlogn)
// Space: O(1)

class Solution {
public:
    int maxBoxesInWarehouse(vector<int>& boxes, vector<int>& warehouse) {
        sort(rbegin(boxes), rend(boxes));
        int result = 0;
        for (const auto& h : boxes) {
            if (h > warehouse[result]) {
                continue;
            }
            if (++result == size(warehouse)) {
                break;
            }
        }
        return result;
    }
};

// Time:  O(nlogn + m)
// Space: O(1)
class Solution2 {
public:
    int maxBoxesInWarehouse(vector<int>& boxes, vector<int>& warehouse) {
        sort(begin(boxes), end(boxes));
        for (int i = 1; i < size(warehouse); ++i) {
            warehouse[i] = min(warehouse[i], warehouse[i - 1]);
        }
        int result = 0, curr = 0;
        for (int i = size(warehouse) - 1; i >= 0; --i) {
            if (boxes[curr] > warehouse[i]) {
                continue;
            }
            ++result;
            if (++curr == size(boxes)) {
                break;
            }
        }
        return result;
    }
};