The council of the orchid house of Bloomglass pays by the answer, and Silas intends to earn it. First: the full register of ledgers. 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 <= 3674; -1000000 <= a[i],x <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 3674; -1000000 <= a[i],x <= 1000000.
