<p>Given an integer array <code>nums</code>, return <em>the number of <strong>reverse pairs</strong> in the array</em>.</p>

<p>A <strong>reverse pair</strong> is a pair <code>(i, j)</code> where:</p>

<ul>
	<li><code>0 &lt;= i &lt; j &lt; nums.length</code> and</li>
	<li><code>nums[i] &gt; 2 * nums[j]</code>.</li>
</ul>

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

<pre>
<strong>Input:</strong> nums = [1,3,2,3,1]
<strong>Output:</strong> 2
<strong>Explanation:</strong> The reverse pairs are:
(1, 4) --&gt; nums[1] = 3, nums[4] = 1, 3 &gt; 2 * 1
(3, 4) --&gt; nums[3] = 3, nums[4] = 1, 3 &gt; 2 * 1
</pre>

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

<pre>
<strong>Input:</strong> nums = [2,4,3,5,1]
<strong>Output:</strong> 3
<strong>Explanation:</strong> The reverse pairs are:
(1, 4) --&gt; nums[1] = 4, nums[4] = 1, 4 &gt; 2 * 1
(2, 4) --&gt; nums[2] = 3, nums[4] = 1, 3 &gt; 2 * 1
(3, 4) --&gt; nums[3] = 5, nums[4] = 1, 5 &gt; 2 * 1
</pre>

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

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

class Solution {
public:
    int merge(vector<long long>& arr, long long low, long long mid, long long high) {
        long long left = low, right = mid + 1;
        vector<int> temp(high - low + 1);
        long long cnt = 0;
        long long cur = 0;

        // Count reverse pairs
        while (left <= mid && right <= high) {
            if (arr[left] > 2ll * arr[right]) {
                cnt += mid - left + 1; // Count inversions
                right++;
            } 
            else {
                left++;
            }
        }

        left = low;
        right = mid + 1;

        // Merge the two halves
        while (left <= mid && right <= high) {
            if (arr[left] <= arr[right]) {
                temp[cur++] = arr[left++];
            } else {
                temp[cur++] = arr[right++];
            }
        }

        while (left <= mid) {
            temp[cur++] = arr[left++];
        }

        while (right <= high) {
            temp[cur++] = arr[right++];
        }

        for (int i = low; i <= high; i++) {
            arr[i] = temp[i - low];
        }

        return cnt;
    }

    long long mergesort(vector<long long>& arr, long long low, long long high) {
        if (low >= high)
            return 0;
        long long mid = (low + high) / 2;

        long long left_inversions = mergesort(arr, low, mid);
        long long right_inversions = mergesort(arr, mid + 1, high);
        long long merge_inversions = merge(arr, low, mid, high);
        return left_inversions + right_inversions + merge_inversions;
    }

    int reversePairs(vector<int>& nums) {
        vector<long long>arr;
        for(auto it:nums) arr.push_back(it);
        return mergesort(arr, 0, nums.size() - 1);
    }
};

119816