It all adds up to 11.

Find the least $k$ such that any $k$ -element subset of $\left\{ 1,2,...,10 \right\}$ contains numbers whose sum is divisible by 11.