Inversions Easy

★★★★★

1.5

2 votes

Easy

Details

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*10³
1 <= Ai <= 10⁹

Sample Input

5
5 1 2 4 3

Sample Output

Time Limit: 1

Memory Limit: 256

Source Limit: