Given an array of integers, write a method with a time complexity nlogn$)$ that returns an array containing the counts of elements greater than every element in the array.

For example:

If the input array is: $\{4,6m1,9,11,5\}$

Then the returned array will be: $\{5,3,2,6,1,0,4\}$