Find the maximum number of pairs we can form such that the difference of pair is not less than k.

Ex : n= 6,k=3;
[1,4,7,10,13,15]
Output : 3
here is my approach .. and i am wrong answer on two test cases ..
plz help :)