Runtime analysis of sorting an array with known number of inversions
Hint: Make use of the following facts:


Each pair $i,j$ that forms an inversion for sorting in ascending order, does not form an inversion when sorting in descending order (and vice versa).
Reversing the complete list can be done in $\Theta(n)$.