Candy Allocation Problem: Suppose there are $n$ candies, each with a weight $w_i$ gram. There are $m$ kids, and each kid needs to eat at least $\omega$ grams of candies to be full. Candies cannot be cut into pieces. Is there a candy allocation algorithm such that at least $k$ kids can be full?Is the above problem NP-complete? It has some similarity to knapsack, but not exactly the same. Can someone help me?
Is this simple problem NP-complete?
complexity theory;np complete;np hard;np