Solve SRM 601, Div 2, Problem WinterAndMandarins

- for me very tough problem, personally I'm very proud of solving it all
1. solution enumerating all possible combinations
2. solution trying Dynamic Programming (however, the problem is not recursive!)
3. correct solution: sort bags and then inspect every consecutive K bags