[배열] 백준 1756번 피자 굽기

1. 문제

2. 나의 풀이

• 시간초과나는 나의 풀이

D, N = [int(x) for x in input().split()]
ovens = [int(x) for x in input().split()]
doughs = [int(x) for x in input().split()]
rlt = list()

is_exit = False
for i in range(D-1, -1, -1):
    if doughs and ovens[i] > doughs[0]:
        doughs.pop(0)
        rlt.append(i)
        is_exit = True
    elif doughs:
        continue
    else:
        break

if is_exit:
    print(rlt[-1]+1)
else:
    print(0)

3. 남의 풀이

• https://jovialcode.tistory.com/27
• https://tothefullest08.github.io/algorithm/2019/03/09/3_5099_%ED%94%BC%EC%9E%90%EA%B5%BD%EA%B8%B0/
• http://choonslife.blogspot.com/2018/07/1756.html

4. 느낀 점