SMO 2010 Senior Round 1 Question 26

Let $S=\{1,2,3,4,\ldots,100000\}$. Find the least possible value of $k$ such that any subset $A$ of $S$ with $|A|=2010$ contains two distinct numbers $a,b$ with $|a-b|\le k$.