ISL 2007 C4
Let be a finite sequence of real numbers. For each , from the sequence we construct a new sequence in the following way. 1. We choose a partition , where and are two disjoint sets, such that the expression attains the smallest possible value. (We allow the sets or to be empty; in this case the corresponding sum is 0 .) If there are several such partitions, one is chosen arbitrarily. 2. We set , where if , and if . Prove that for some , the sequence contains an element such that . (Iran)
Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.
Official text: IMO 2007 Shortlist booklet, page 32.
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).
Similar problems
These problems have the most words in common with this statement.