why do we take computational distinguishability over ensembles
Why not just define it over two distributions $X$ and $Y$?

Because this is an asymptotic definition (using a negligible function explicitly).
If you were to only consider two fixed distributions, there would be no scaling with the security parameter (and thus the involved lengths) possible. This is why we use ensembles, parametrized by the value of the security parameter $n$.