Reduction to $n\log n$ time problem
You can't guarantee that $A$ can also be solved in time $O(n\log n)$ because the reduction from $A$ to $B$ might require more time than that (for example, $n^3$ steps).