Skip to main content
OlympiadHQ

Browse · MathNet

Print

Selection and Training Session

Belarus counting and probability

Problem

The sum of several positive numbers from is equal to . It is known that one with the guarantee can divide all given numbers into two groups such that the sum of numbers in the first group does not exceed and the sum of numbers in the second group does not exceed . Find the maximum possible value of .
Solution
Answer: .

We first show that (obviously, ). Suppose that . Then we may write , where . It can occur that we have numbers, of which are equal to and the last one is equal to . It is clear that it is impossible to divide such numbers into two groups as required in the problem conditions.

Now prove that any satisfies the problem conditions. There is nothing to prove if . So we may assume that . Then among the given numbers there are several numbers with the sum and some number such that . Denote by the sum of all remaining numbers, .

We have .

If then , so we can include in the first group all numbers with sum , and to the second group include all remaining numbers with sum .

Finally, if then , hence we can include in the first group and all other numbers in the second group.
Final answer
5.5

Techniques

Coloring schemes, extremal argumentsGames / greedy algorithmsLinear and quadratic inequalitiesCombinatorial optimization