197 人解决，291 人已尝试。
249 份提交通过，共有 1428 份提交。
3.6 EMB 奖励。
单点时限: 4.0 sec
内存限制: 256 MB
You want to process a sequence of $n$ distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order.
There are several test cases, please process till
For each test case, the first line contains integer $n$ $(1 \leq n \leq 10^5)$. The second line contains $n$ space-separated integers $a_1, a_2, \ldots, a_n$ $(1 \leq a_i \leq 10^9)$.
For each test case, output the minimum times of swapping in one line.
2 1 2