KöMaL 2012 B4455
Consider a finite set of positive numbers such that no number is greater than the sum of the other numbers. Prove that it is possible to partition the numbers into two sets such that the sum of the numbers in one set is at most twice the sum of the numbers in the other set.
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.