[Algorithm🧬] 정올 1697 : 큐(queue)

문제

import sys
from collections import deque

# 입력 처리
n = int(input())
inputs = [list(input().split()) for _ in range(n)]

queue = deque()

for inp in inputs:
    if inp[0] == 'o':
        if queue:
            print(queue.popleft())
        else:
            print("empty")
    elif inp[0] == 'i':
        queue.append(inp[1])
    elif inp[0] == 'c':
        print(len(queue))