yes its cfl, when you compare i and j only two cases happen either i is less than or equal to j or j is less than equal to i. So we don't need to check this condition. Remaining is j=k. So you can write above language as
$L = \left \{a^{i}b^{n}c^{n} \right \}$, which is certainly a CFL.