[백준][동적 계획법1] 1149. RGB거리(파이썬/Python)

n = int(input())
house = []
for i in range(n):
    house.append(list(map(int, input().split())))
for i in range(1, len(house)):
    house[i][0] = min(house[i - 1][1], house[i - 1][2]) + house[i][0]
    house[i][1] = min(house[i - 1][0], house[i - 1][2]) + house[i][1]
    house[i][2] = min(house[i - 1][0], house[i - 1][1]) + house[i][2]
print(min(house[n - 1][0], house[n - 1][1], house[n - 1][2]))