Let $R(k)$ be the Ramsey number for $K_k$, the minimal $n$ such that every $2$-colouring of the edges of $K_n$ contains a monochromatic copy of $K_k$.

Give a constructive proof that $R(k)>C^k$ for some constant $C>1$.