Merging $k$ sorted lists in $O(n\log k)$ time
Yes, you are right.

$O(c \cdot f(n)) = O(f(n))$ for any constant $c$.

It may also be written (maybe even more clear) in the form
$$O(k) + O(n \lg k) + O(n \lg k) = O(n \lg k)$$