Submission #3427144

Source Code Expand

(let* ((n (read))
      (m (read))
      (lst (sort (loop :for k :from 1 :upto n collect(read)) #'<)))
  (format t "~A" (+ n (floor (- m (reduce #'+ lst)) (first lst)))))

Submission Info

Submission Time
Task B - Bitter Alchemy
User artoshimitsu
Language Common Lisp (SBCL 1.1.14)
Score 200
Code Size 175 Byte
Status AC
Exec Time 22 ms
Memory 4836 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 13
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13
Case Name Status Exec Time Memory
a01 AC 22 ms 4836 KB
a02 AC 15 ms 4196 KB
a03 AC 16 ms 4200 KB
b04 AC 15 ms 4196 KB
b05 AC 15 ms 4196 KB
b06 AC 15 ms 4324 KB
b07 AC 15 ms 4320 KB
b08 AC 15 ms 4320 KB
b09 AC 15 ms 4320 KB
b10 AC 15 ms 4324 KB
b11 AC 15 ms 4328 KB
b12 AC 16 ms 4328 KB
b13 AC 15 ms 4324 KB