PerlimpinpinBetter.java

// Generate all possible sub-lists (PowerSet algorithm)
Set<List<Item>> subLists = generateAllSubLists(items);
// Find best solution for each sub-set
SortedSet<Solution> solutions = new TreeSet<>();
for (List<Item> sublist : subLists) {
  Solution solution = findBestSolution(maxWeight, sublist);
  solutions.add(solution);
}
// No need to sort solutions, TreeSet implements SortedSet
Solution best = solutions.first();
System.err.println(best);
System.out.println(best.getPrice());