Every season at the cedar groves of Balmcrest, someone must fulfill a tricky customer order. This year the task falls to Squire, armed only with the ledgers register. 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 <= 3666; 0 <= a[i],x <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 3666; 0 <= a[i],x <= 1000000000.
