Minimized Maximum of Products Distributed to Any Store

Medium

Given an array nums where nums[i] is the quantity of the i-th product, distribute all products to target stores. Each store gets at most one product type and any quantity (including zero). Return the minimum possible value of the maximum number of products given to any single store.

Example 1

Input:  nums = [11,6], target = 10
Output: 3

Example 2

Input:  nums = [15,10,10], target = 7
Output: 5

Constraints

• 1 <= nums.length <= 10^5
• 1 <= nums[i] <= 10^5
• nums.length <= target <= 10^5