Dividing into Groups

Chef has $N$ boxes, numbered from $1$ to $N$. The $i^{th}$ box contains $A_i$ candies, which are all of the same color. Also, candies from two different boxes never have the same color. Your goal is to create as many $\text{Groups}$ as possible, where - A $\text{Group}$ is a collection of exactly $K$ candies. - No two candies in the same $\text{Group}$ can have the same color. - A particular can