OPCPIZZA  Pizzamania
Singham and his friends are fond of pizza. But this time they short of money. So they decided to help each other. They all decided to bring pizza in pairs. Our task is to find the total number of pairs possible which can buy pizza, given the cost of pizza. As pizza boy dont have any cash for change, if the pair adds upto more money than required, than also they are unable to buy the pizza. Each friend is guaranteed to have distinct amount of money. As it is Singham's world, money can also be negative ;).
Input
The first line consist of t (1 <= t <= 100) test cases. In the following 2*t lines, for each test case first there is n and m, where n (1 <= n <= 100000) is number of Singham's friend and m is the price of pizza. The next line consist of n integers, seperated by space, which is the money each friend have.
The value of m and money is within the limits of int in C, C++.
Output
A single integer representing the number of pairs which can eat pizza.
Example
Sample Input: 2 4 12 9 3 4 3 5 9 7 3 2 8 7 Sample Output: 1 1
hide comments
tarun_28:
20200101 18:11:36
they all have 'distinct' amount of money;) 

iqrar99:
20191008 06:18:16
I keep getting TLE using Java. I'm using binary search but it's still TLE. My algorithm is same as many people who got AC here. I already use BufferedReader to read input. what should I fix? 

jonmanu:
20181023 21:52:09
can anyone please explain: how is this a question of binary search?


phoemur:
20180908 04:17:49
Why the solutions for


rohitnarayan:
20180621 20:09:20
This problem has large inputs. Either use scanf or use ios_base statement with cin/cout


pratikrahul:
20180519 18:49:59
O(nlogn+n) got AC.......where the hell was the binary search?? 

ankur314:
20180515 05:31:35
after a series of TLE, finally binary search gave AC! 

ragh_1995:
20180403 09:20:25
It's getting tle in java


pynoob01:
20180113 01:36:03
I keep getting TLE with both using sets as well as using two pointers. Is it because I am using Python? 

sameer_hack:
20171206 23:04:54
Delete it. Last edit: 20171206 23:10:07 
Added by:  ! include(L.ppt) 
Date:  20120831 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  MNNIT OPC 31082012 