Significant inversions#7031
Consider an arbitrary sequence of numbers x_1, x_2, \dots, x_n.A pair of indices (j, k) is called an inversion (a violation of order) if j < k and x_j > x_k.For any non-negative integer , a pair of indices (j, k) is called a -significant inversion if j < k and x_j > x_k + t.
Count the number of -significant inversions in the sequence x_1, x_2, \dots, x_n.
The first line contains two integers (1 \le n \le 50000) and (0 \le t \le 10^9).The second line contains the sequence of integers x_1, x_2, \dots, x_n, each with an absolute value not exceeding 10^9.
Print the number of -significant inversions in the sequence x_1, x_2, \dots, x_n.
Example 1