The store warden Tailor has been asked to price the new merchandise line. On the desk lies a long table of shelves readings. 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 <= 1497; -1000000 <= a[i],x <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1497; -1000000 <= a[i],x <= 1000000000.
