sort(a, a + n);
int ans = 0, j = 0;
for(int i = 0; i < n; i++)
{
    while(a[j] - a[i] < k) j++;
    if(j >= n) break;
    ans += n - j;
}
cout << ans;