Consider a partition of $\{1,2,\ldots,900\}$ into $30$ subsets $S_1,S_2,\ldots,S_{30}$ each with $30$ elements. In each $S_k$, we paint the fifth largest number blue. Is it possible that, for $k=1,2,\ldots,30$, the sum of the elements of $S_k$ exceeds the sum of the blue numbers?
Problem
Source: XIII Rioplatense Mathematical Olympiad (2004), Level 3
Tags: combinatorics unsolved, combinatorics