PAIRS1  Count the Pairs
Given N integers [0<N<=10^5], count the total pairs of integers that have a difference of K. (Everything can be done with 32 bit integers).
Input Format
1st line contains N & K (integers).
2nd line contains N numbers of the set. All the N numbers are distinct.
Output Format
One integer  the number of pairs of numbers that have a diff K.
Sample Input :
5 2
1 5 3 4 2
Sample Output :
3
Sample Input :
10 1
363374326 364147530 61825163 1073065718 1281246024 1399469912 428047635 491595254 879792181 1069262793
Sample Output :
0
hide comments
atharvat77:
20190104 17:01:31
Good Question To Apply Binary Search


sudhanshu6324:
20180827 08:27:34
all nos are not distinct


DOT:
20180817 22:17:07
I guess the test cases are weak, because I only employed sorting and compared the differences linearly in 2 loops, yet my code ran in 0.03s. 

anubhav1772:
20170714 21:03:33
Good Question :) 

uddeshya2257:
20170628 18:18:40
AC in one go....good use of sorting and binary search 

Sigma Kappa:
20170623 13:43:01
I've solved it in O(nlogn), basically for each position you do two binary searches. 

onkar14_n:
20170618 07:08:25
The problem is same as HACKRNDM 

sir_zaid:
20170211 06:20:34
nothing in the question,just use sets!


hugewarriors:
20161228 14:54:45
AC in 1 Go.......!!!


naman_ntc:
20161207 06:22:57
i am getting time limit excedded. i guess its O(n^2) solution only!! 
Added by:  psn 
Date:  20131018 
Time limit:  0.5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own 