takeU

https://www.youtube.com/watch?v=74_yqNBhQbA https://www.youtube.com/watch?v=IDD5_z3kKCU https://www.youtube.com/watch?v=FIsCYzu_1Gc https://www.youtube.com/watch?v=d4eiB-nmIoo https://www.youtube.com/watch?v=FZnW6A2k9tw

https://www.youtube.com/watch?v=kMCdVAtLJt0&list=PL42x9b3o_xjxDm6z-nKrq9900IsMOFZT5&index=21 https://www.youtube.com/watch?v=Kh2Zdl-kxGI https://www.youtube.com/watch?v=PEKkP_jRHh0 https://www.youtube.com/watch?v=U_cMhyQunJg

from itertools import combinations n = int(input()) li = [] for i in range(1, 11): for com in combinations(range(10), i): com = sorted(list(com), reverse=True) li.append(int("".join(map(str, com)))) li.sort() print(li[n] if len(li) > n else -1) 완탐

https://www.youtube.com/watch?v=JA-PUJb449o https://www.youtube.com/watch?v=TcBDL124egM https://www.youtube.com/watch?v=0spul3Sdp6I

https://www.youtube.com/watch?v=KsznX5j2oQ0 https://www.youtube.com/watch?v=pgm4VRxMcew https://www.youtube.com/watch?v=bLGc8R-t2hw https://www.youtube.com/watch?v=4Mm3mcUqqKE https://www.youtube.com/watch?v=E2gqS8j8vSI

https://www.youtube.com/watch?v=wvpknmu5UIY https://www.youtube.com/watch?v=BR-ynPJ1dj0 https://www.youtube.com/watch?v=yp-zkC2aXv0 https://www.youtube.com/watch?v=RZMOvrWj_cE https://www.youtube.com/watch?v=LV3vxkZpUjk

https://www.youtube.com/watch?v=i6efrsAuBI4 https://www.youtube.com/watch?v=78C_YqYwdJs https://www.youtube.com/watch?v=_NmzMzjoJyk https://www.youtube.com/watch?v=-e7mCnwTXqI https://www.youtube.com/watch?v=a1icUrWPUD4 https://www.youtube.com/watch?v=ARfp8uXqCQI https://www.youtube.com/watch?v=ArY8PJB20Fk https://www.youtube.com/watch?v=QBJ7TQYJaz0

https://www.youtube.com/watch?v=iHY76VIN2cU https://www.youtube.com/watch?v=4MHtpmtr-4k https://www.youtube.com/watch?v=WIn8R7gbYbY https://www.youtube.com/watch?v=S6nShk9kRlk https://www.youtube.com/watch?v=DGFsc3Ksqug

n = int(input()) board = [list(map(int, input().split())) for _ in range(n)] dp = [[int(1e6)] * 3 for _ in range(n)] ans = int(1e6) for i in range(3): dp[0] = [int(1e6)] * 3 dp[0][i] = board[0][i] for j in range(1, n): dp[j][0] = board[j][0] + min(dp[j - 1][1], dp[j - 1][2]) dp[j][1] = board[j][1] + min(dp[j - 1][0], dp[j - 1][2]) dp[j][2] = board[j][2] + min(dp[j - 1][0], dp[j - 1][1]) for j in..