> Given a set of integers of different values how do I calculate the > minimum number of the largest of integers that are required, when > summed, to equal 50% of the total sum of the the set? > Actually I need the value of the smallest member such that the sum of all members equal or greater to that is 50% of the total sum of the set