|
||||||||||
pairsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8844 Accepted Submission(s): 3251 Problem Description John has $n$ points on the X axis, and their coordinates are $(x[i],0),(i=0,1,2,бн,n-1)$. He wants to know how many pairs$<a,b>$ that $|x[b]-x[a]| \leq k. (a<b)$ Input The first line contains a single integer $T$ (about 5), indicating the number of cases. Each test case begins with two integers $n,k (1 \leq n \leq 100000,1 \leq k \leq {10}^{9})$. Next $n$ lines contain an integer $x[i] ({-10}^{9} \leq x[i] \leq {10}^{9})$, means the X coordinates. Output For each case, output an integer means how many pairs$<a,b>$ that $|x[b]-x[a]| \leq k$. Sample Input
Sample Output
Source | ||||||||||
|