You are given a $0$ indexed integer array candies, where each candies[i] denotes the number of candies in the $i$th pile. You are also given an integer k.

You can divide any pile into any number of smaller subpiles, but you cannot merge different piles together.

You want to distribute the candies such that each of the k children gets the same number of candies. Each child can receive at most one subpile of candies, and some candies may remain unused.

Return the maximum number of candies each child can obtain. If it is impossible to distribute at least $1$ candy to each child, return $0$.

Constraints:

• $1 \leq$ candies.length $\leq 10^5$

• $1 \leq$ candies[i] $\leq 10^7$

• $1 \leq$ k $\leq 10^{12}$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.