LeetCode 493 Reverse Pairs - Problem Statement

Input: Integer array.

Output: Count of pairs where nums[i] > 2*nums[j] and i < j.

Example: [1,3,2,3,1] → 2 pairs.

Constraints: $1 \le$ nums.length $\le 5 \times 10^4$.