> 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 th
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?
For example,
> length(myTable$lgth)
[1] 303403
> sum(myTable$lgth)
[1] 4735396
I know through brute force that
2 matches
Mail list logo