In Chapter DP from permutations to subsets, there is a problem about elevators. There is an elevator with maximum weight x, and n people with known weights who want to get from the ground floor to the top floor. What is the minimum number of rides needed if the people enter the elevator in an optimal order?
I found one solution, it is to find the subset of people with maximum weight we can send every time and send those elements. I think it's time complexity works for n <= 20. It seems incorrect but I couldn't find any counterexample. Is there any counterexample?
It is correct solution. I dont find counterexample.
proofs discovered in 1800s,
people in 1799s:
Maybe you greedy-algorithm is wrong.
The number of people is $$$10$$$.
$$$5$$$ people wighted $$$23$$$ and $$$5$$$ people wighted $$$6$$$. Maximum weight $$$x$$$ is $$$33$$$.
You will choose $$$6$$$ times:
$$$(6,6,6,6,6)$$$
$$$(23)$$$
$$$(23)$$$
$$$(23)$$$
$$$(23)$$$
$$$(23)$$$
Maybe I can choose $$$5$$$ times:
$$$(6,23)$$$
$$$(6,23)$$$
$$$(6,23)$$$
$$$(6,23)$$$
$$$(6,23)$$$
Thank you bro!!!!