RSA polynomial cubic root
Is there any way to solve for pair(x,y)?

If you're looking for an arbitrary pair, it's easy (assuming $a \ne 0$).

Pick an arbitrary $y$

Solve for $f(x) = y^3$; that'd be $x = a^{-1}(y^3 - b) \pmod{n}$


You're done.