#281 · #2064 · Minimized Maximum of Products Distributed to Any Store(分配给商店的最多商品的最小值)

You are given n stores and an array quantities where quantities[i] is the number of products of type i. You must distribute all products to the stores, and each store receives products of only one type. Return the minimum possible maximum number of products given to any store. Constraints: 1 <= n <= 10^5, 1 <= m <= 10^5, 1 <= quantities[i] <= 10^5.