Is this problem still as hard as discrete logarithm (modified ElGamal)?
Yes, the system is easily breakable.  We have:

$$(g^r)^{k+s} / g^{rs} = g^{rk}$$

You don't list $g^r$ in your problem statement, however it is in the ciphertext, and so we can assume the attacker knows it.