题目描述
The chef has one array of N natural numbers (might be in sorted order). Cheffina challenges chef to find the total number of inversions in the array.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow.
- Each test case contains two lines of input, $N$.
- N space-separated natural numbers.
-----Output:-----
For each test case, output in a single line answer as the total number of inversions.
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 10^5$
- $1 \leq arr[i] \leq 10^5$
-----Sample Input:-----
1
5
5 4 1 3 2
-----Sample Output:-----
8
输入格式
见题面
输出格式
见题面
样例输入
['1', '5', '5 4 1 3 2']
样例输出
['8']