Leetcode 1564. Put Boxes Into the Warehouse I

Given arrays of box heights and warehouse room heights, maximize how many boxes can be placed knowing a box can only reach a room if its height is ≤ the minimum height along the path to that room (so each room's effective capacity is its prefix minimum). The core challenge is a greedy matching problem using prefix minima on warehouse heights and sorting/two-pointer placement of boxes.