[파이썬][프로그래머스] 탐욕법(Greedy) 구명보트

from collections import deque
def solution(people, limit):
    answer = 0
    people.sort(reverse=True)
    people = deque(people)
    while len(people) > 1:
        bigP = people.popleft()
        smallP = people.pop()
        if bigP + smallP <= limit:
            answer += 1
        else:
            people.append(smallP)
            answer += 1
    if len(people) == 1:
        answer += 1
    return answer