Count the pairs with maximum difference
Submissions: 1415   Accuracy:

15.77%

  Difficulty: Easy   Marks: 2

Given an array of N elements, the task is to find the number of ways of choosing pairs with maximum difference.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of two lines. First line of each test case contains an integer N and the second line contains N space separated array elements.

Output:
For each test case, print the count of pairs in new line.

Constraints:
1<=T<=100
1<=N<=105

1<=A[i]<=105

Example:
Input:

2
5
3 2 1 1 3
3
1 2 3

Output:
4
1

Explanation:

Input : A[] = {3, 2, 1, 1, 3}
Output : 4
Here, the maximum difference you can find is 2
which is from (1, 3).
No. of ways of choosing it:
 1) Choosing the first and third elements,
 2) Choosing the first and fourth elements,
 3) Choosing the third and fifth elements,
 4) Choosing the fourth and fifth elements.
Hence ans is 4.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Arun Tyagi
Author: arun03


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.