Определить номер строки матрицы, сумма элементов которой наибольшая

(defun max-line (w &aux (v (mapcar #'(lambda (a) (apply #'+ a)) w)))
  (position (reduce #'max v) v))
 
> (max-line '((1 2 3) (1 2 4) (1 2 3)))
1

(defun sum (w)
  (if w (+ (car w) (sum (cdr w))) 0))
 
(defun line (w m n)
  (cond ((null w) (car m))
        ((> (sum (car w)) (cadr m)) (line (cdr w) (list (1+ n) (sum (car w))) (1+ n)))
        ((line (cdr w) m (1+ n)))))
 
(defun max-line (w)
  (when w (line (cdr w) (list 0 (sum (car w))) 0)))
 
> (max-line '((1 2 5) (1 2 4) (1 2 3)))
0
> (max-line '((1 2 3) (1 2 4) (1 2 3)))
1
> (max-line '((1 2 3) (1 2 4) (1 2 7)))
2

(defun sum (w)
  (if w (+ (car w) (sum (cdr w))) 0))
 
(defun line (w m n &aux (s (sum (car w))))
  (cond ((null w) (car m))
        ((> s (cadr m)) (line (cdr w) (list (1+ n) s) (1+ n)))
        ((line (cdr w) m (1+ n)))))
 
(defun max-line (w)
  (when w (line (cdr w) (list 0 (sum (car w))) 0)))
 
> (max-line '((1 2 3) (1 2 4) (1 2 7)))
2
> (max-line '((1 2 3) (1 2 4) (1 2 3)))
1
> (max-line '((1 2 5) (1 2 4) (1 2 3)))
0

(defun task (matr)
  (let* ((rs (mapcar #'(lambda (x) (apply '+ x)) matr))
         (rn nil)
         (rn (dotimes (i (length rs) (reverse rn)) (push i rn)))
         (ma (apply 'max rs)))
       (remove nil (mapcar #'(lambda (x y) (if (= x ma) y nil)) rs rn))))
    
==> task
 
(task '((1 1 1) (2 2 2) (3 3 3) (2 2 2) (3 3 3)))
 
==> (2 4)

(defun task (matr)
  (let ((rsum nil) (ma (caar matr)) (rm nil))
      (iter (for r in matr) (collecting (apply '+ r) into rsum))
      (iter (for i in rsum) (maximizing i into ma))
      (iter (for j in rsum) (for k from 0 to (1- (length rsum)))
            (when (= j ma) (collecting k into rm)))
      rm))
 
 
==> task
 
(task '((1 1 1) (2 2 2) (3 3 3) (2 2 2) (3 3 3)))
 
==> (2 4)

(defun max_line (mx / ListOfSums MaxSum  Sum i Result)
  (setq ListOfSums    (mapcar '(lambda (x) (apply '+ x)) mx)
    MaxSum    (apply 'max ListOfSums)
    i      0
    Result '()
  )
  (foreach Sum ListOfSums
    (if (= Sum MaxSum)
      (setq Result (cons i Result))
    )
    (setq i (1+ i))
  )
  (reverse Result)
)