Deterministic algorithms for computational distance between distributions
Hint:

 Every randomized algorithm $A(x)$ can be expressed as a deterministic algorithm $A(x;r)$ where $r$ is randomly chosen.  Now what can you say about the value of that absolute difference for different choices of $r$?  What would you like to be able to say about it?