Inversions Easy
Problem
Given an array A of N integers. Find total number of pairs such that i < j and A[i] > A[j].
Constraints
1 <= N <= 2*103
1 <= Ai <= 109
Time Limit: 1
Memory Limit: 256
Source Limit:
Given an array A of N integers. Find total number of pairs such that i < j and A[i] > A[j].
Constraints
1 <= N <= 2*103
1 <= Ai <= 109
