HMMT 2011 U8

Find the smallest $k$ such that for any arrangement of 3000 checkers in a $2011 \times 2011$ checkerboard, with at most one checker in each square, there exist $k$ rows and $k$ columns for which every checker is contained in at least one of these rows or columns.