Pick $m$ numbers in $[0,1]$, independently and uniformly at random. It is known that the expected value of the smallest number is $1/(m+1)$ and of the largest number is $m/(m+1)$.
Now, partition the numbers into two sets, such that sum of numbers in the set with the smaller sum is as large as possible (in other words: solve the partition problem on the numbers).
What is the expected value of the smaller sum?