Caravans arrive at the fen lights of Will-o-Wisp with crates of ledgers, and Pavel the measurer must account for every last one. Task: Print the number of inversions: index pairs (i,j) with i<j but a[i] > a[j]. Input format: First line: n. Second line: n integers. Output format: Print the inversion count (fits 64-bit). Constraints: 1 <= n <= 1852; 0 <= a[i],x <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1852; 0 <= a[i],x <= 1000000000.
