#278 · #2226 · Maximum Candies Allocated to K Children(分配给 K 个孩子的最大糖果数)

You are given a 0-indexed integer array candies where candies[i] is the number of candies in the i-th pile, and an integer k. Each child receives candies from a single pile, and piles cannot be split across children. Return the maximum number of candies each child can get. Constraints: 1 <= candies.length <= 10^5, 1 <= candies[i] <= 10^7, 1 <= k <= 10^12.