Lookup for upperbound of ( cSum - K ) in hash
let al = [ ] ; let end = 0 ; for ( let it of cum_set ) { end = it ; al . push ( it ) ; } al . sort ( ( a , b ) => a - b ) ; let sit = lower_bound ( al , cSum - K ) ;