Maximum Candies Allocated to K Children

Problem: Maximum Candies Allocated to K Children You have an integer array candies, with candies[i] representing the quantity in pile i, along with an integer k denoting the number of children. A pile may be divided into multiple smaller piles, but candies originating from separate piles cannot be combined. Each child may receive no more than one pile, and all children who receive candy must receive the same quantity. Determine the greatest number of candies that can be…