Maximum Candies Allocated to K Children

Medium

Given an array nums of candy piles and an integer target (= k children), split piles (never merge) so every child gets the same number of candies from a single sub-pile. Return the maximum number of candies each child can get; return 0 if it is impossible to give every child at least one candy.

Example 1

Input:  nums = [5,8,6], target = 3
Output: 5

Example 2

Input:  nums = [2,5], target = 11
Output: 0

Constraints

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