Minimized Maximum of Products Distributed to Any Store

Given m product types and n stores where each store can hold at most one type (but any amount), minimize the maximum number of items any store receives; this reduces to finding the smallest x such that sum ceil(quantities[i]/x) ≤ n, typically solved by binary-search on x with a greedy feasibility check.