Optimizing 1-0 Knapsack problem to maximize weight instead of value

Question

I want to know how to approach the following problem: given a limited amount of people allowed on a bus (not exceeding 100) and the following data: group name, amount of mem