I would like to now if this question on Stack Exchange can be generalised. We generalise the problem as follows. There are k types of object and n boxes each which may contain any number of objects (the boxes don't have to only contain the same type). If we know the contents of each box, what is the minimum number of boxes we must select to guarantee getting at least half of each type of object.