Middle European Mathematical Olympiad 2025 Problem T-1

Bob has $n$ coins with integer values $$c_1 \geq c_2 \geq \cdots \geq c_n > 0.$$

He is standing in front of a vending machine that offers $n$ candy bars with positive integer costs $b_1, b_2, \ldots, b_n$. Bob notices that for every $i \in \{1, \ldots, n\}$, it holds that $$b_1 + b_2 + \cdots + b_i \geq c_1 + c_2 + \cdots + c_i.$$

Furthermore, the total value of Bob's coins equals the sum of the costs of all the candy bars. The candy bars can be purchased in any order. In order to buy the $i$-th candy bar, Bob has to insert coins of total value at least $b_i$. However, the machine does not give him back any change.

Prove that Bob can buy at least half of the candy bars.