Is the language $L=\{a^nb^mc^k | k \ge max (m,n) \}$ CF
Your intuitive argument is wrong. If you print a $c$ for every $a$ or $b$ you see, then the language will have $k\ge m+n$ rather than $k\ge \max\{m,n\}$.