daily-coding-pairs-sum-lisp Given two arrays and a number x, find the pair in arrays whose sum is closest to x. Test sbcl --non-interactive --eval "(ql:quickload :pairs-sum/tests)" --eval "(asdf:test-system :pairs-sum)"