Think of the case when i=k,
In that case the Language will be 0n1n0n Which is definitely a CSL.
So the language is not CFL.
Also, there can be other ways of proving the same such as considering the cases where i>k or i<k but this was the fastest I could think of.