How to find a subset in a nested list which has the highest sum of their elements in python?

Question

I am looking for a way to find a subset in a nested list which has the highest sum of their elements.

Initially I have a flat list. This list is going to be converted