[그리디] [파이썬] [백준] 11047번 동전0

#백준 11047번 동전 0 (그리디사용 X)
n,k = map(int, input().split())
a = []
for _ in range(n):
    a.append(int(input()))
a.reverse()
won, i,count = 0,0,0
while True:
    if won < k:
        won += a[i]
        count += 1
    elif won > k:
        won -= a[i]
        count -= 1
        i += 1
    else:
        break
print(count)

그리디는 개뿔.. 당연히 시간초과

#백준 11047번 동전 0
n,k = map(int, input().split())
a = []
for _ in range(n):
    a.append(int(input()))
a.reverse()
count = 0
for i in a:
    if k == 0: break
    count += k//i
    k %= i
print(count)

Uploaded by Notion2Tistory v1.1.0