<그리디> 백준 1969번. DNA (실버 5)

https://www.acmicpc.net/problem/1969

1969번: DNA

import sys
input = sys.stdin.readline
lst = []
res = []
cnt = 0

n, m = map(int, input().split())
for _ in range(n):
  lst.append(list(map(str, input().rstrip())))

for j in range(m): 
  cnt_lst = [0,0,0,0] #A,C,G,T
  for i in range(n): 
    if lst[i][j] == 'A':
      cnt_lst[0] += 1
    elif lst[i][j] == 'C':
      cnt_lst[1] += 1
    elif lst[i][j] == 'G':
      cnt_lst[2] += 1
    elif lst[i][j] == 'T':
      cnt_lst[3] += 1
  if cnt_lst.index(max(cnt_lst)) == 0:
    res.append('A')
  elif cnt_lst.index(max(cnt_lst)) == 1:
    res.append('C')
  elif cnt_lst.index(max(cnt_lst)) == 2:
    res.append('G')
  elif cnt_lst.index(max(cnt_lst)) == 3:
    res.append('T')
  cnt += n - max(cnt_lst)

print(''.join(res))
print(cnt)
"""
5 8
TATGATAC
TAAGCTAC
AAAGATCC
TGAGATAC
TAAGATGT
"""