Count of smaller numbers after self

For every element of an integer array, count how many elements to its right are smaller, and return those counts. The O(n^2) scan is too slow; use merge sort that tracks original indices, or a Fenwick tree over compressed values. The same screen also asked to merge k sorted linked lists and to design getPackage for a parcel locker.