If arr [ i ] is not largest element and element just greater than it is within k , then return false .
if ( u != a + n && ( ( * u ) - a [ i ] ) <= k ) continue ; int * s = lower_bound ( a , a + n , a [ i ] ) ;