INVCNT  Inversion Count
Let A[0...n  1] be an array of n distinct positive integers. If i < j and A[i] > A[j] then the pair (i, j) is called an inversion of A. Given n and an array A your task is to find the number of inversions of A.
Input
The first line contains t, the number of testcases followed by a blank space. Each of the t tests start with a number n (n <= 200000). Then n + 1 lines follow. In the ith line a number A[i  1] is given (A[i  1] <= 10^7). The (n + 1)th line is a blank space.
Output
For every test output one line giving the number of inversions of A.
Example
Input: 2 3 3 1 2 5 2 3 8 6 1 Output: 2 5
hide comments
yasser1110:
20210224 12:25:00
Return type long long vs int tripped me up. Last edit: 20210224 12:25:12 

goku123456:
20210203 19:32:52
A really good sum. But wasted so much time in tle. Pass by reference to remove tle. 

vishalmahavar:
20210121 09:16:47
How is it related to graphs and bitmasks?? 

affan12347:
20210115 16:03:56
monka s . naive array approach doesnt work , gives tle Last edit: 20210115 16:04:21 

tejasreddyk:
20210114 16:29:27
monkagiga count normal variable and std::count messed me up 

sudo_s:
20210101 15:07:07
Very Weak test Cases.


anurag_mishra:
20201128 14:06:41
Take array size 10^7+1 to remove SIGSEGV error 

samartha_5611:
20200820 12:56:34
make bit array of size 2e5+5, otherwise Segmentation falut will come


coolboy7:
20200730 15:26:02
answer will be in range of long long 

robosapien:
20200721 18:11:41
use long long. 
Added by:  Paranoid Android 
Date:  20100306 
Time limit:  3.599s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: PERL6 