We have $2n\times 2n$ binary matrix with $k$ of its elements are $1$. We are searching for an $n\times n$ submatrix full of $1$s.

What is the least $k$ such that we can always find one?

What is the least $k$ for $n=10$?

Definition of submatrix: http://en.wikipedia.org/wiki/Submatrix