Solution for the Code Jam's problem Minimum Scalar Product (https://code.google.com/codejam/contest/32016/dashboard#s=p0)

minimum-scalar-product.lisp

#!/usr/bin/sbcl --script

(with-open-file (in (car (last *posix-argv*)))
  (let ((total-cases (read in)))
    (with-open-file (out "A.out" :direction :output :if-exists :supersede)
      (loop for i from 1 to total-cases do
           (let* ((n (read in))
                  (v1 (loop for j from 0 below n collect (read in)))
                  (v2 (loop for j from 0 below n collect (read in))))
             (format out "Case #~D: ~D~%" i
                     (reduce #'+ (map 'list #'* (sort v1 #'>) (sort v2 #'<)))))))))