<p>Given an integer array <code>nums</code>, return<em> an integer array </em><code>counts</code><em> where </em><code>counts[i]</code><em> is the number of smaller elements to the right of </em><code>nums[i]</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,2,6,1]
<strong>Output:</strong> [2,1,1,0]
<strong>Explanation:</strong>
To the right of 5 there are <b>2</b> smaller elements (2 and 1).
To the right of 2 there is only <b>1</b> smaller element (1).
To the right of 6 there is <b>1</b> smaller element (1).
To the right of 1 there is <b>0</b> smaller element.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [-1]
<strong>Output:</strong> [0]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [-1,-1]
<strong>Output:</strong> [0,0]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution:
    count = []
    def mergeSort(self, nums, c, lo, hi):
        if lo < hi:
            mid = (lo + hi)//2

            self.mergeSort(nums, c, lo, mid)
            self.mergeSort(nums, c, mid+1, hi)

            return self.merge(nums, c, lo, mid, hi)
    
    def merge(self, nums, c, lo, mid, hi):
        
        n = len(nums)
        
        i = lo
        j = mid+1
        k = lo

        cnt=0
        while i <= mid and j <= hi:
            if nums[i][0] <= nums[j][0]:
                c[k] = nums[i]
                self.count[nums[i][1]] += j - mid - 1
                i +=1
                k+=1
            else:
                c[k] = nums[j]
                j += 1
                k+=1

        
        while i <= mid:
            c[k] = nums[i]
            self.count[nums[i][1]] += j - mid -1
            i+= 1
            k+=1
        
        while j <= hi:
            c[k] = nums[j]
            j+= 1
            k+=1

        for i in range(lo, hi+1):
            nums[i] = c[i]
        
    def countSmaller(self, nums: List[int]) -> List[int]:
        lo = 0
        hi = len(nums)
        
        self.count = [0 for i in range(len(nums))]
        c = [(nums[i], i) for i in range(len(nums))]
        temp = [(nums[i], i) for i in range(len(nums))]
        self.mergeSort(temp, c,lo, hi-1)

        print(temp)
        return self.count


        
51793