Is the 0-1 Knapsack that each item has the same weight NP-complete?

Question

The 0-1 Knapsack problem is known as NP-complete. But if the weight for each item are the same, the problem is still NP-complete?

Answer 1

No, because you always just take whatever items are the most valuable.