[Python][프로그래머스][Level2] 구명보트

def solution(people, limit):
    answer=0
    people.sort()
    start,end=0,len(people)-1
    while start<=end:
        while people[end]+people[start]<=limit:
            people[end]+=people[start]
            start+=1
        answer+=1
        end-=1
    return answer