problem can be simplified into:

for every index i, find out if there exist an index j (i < j) where a[i] > a[j] if it exist, then add a[i] to the answer

this is basically the same as counting inversions...