Question 74
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leqslant r \leqslant 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r+2$.