프로그래머스 | 구명보트

function solution(people, limit) {
    var answer = 0;
    people.sort((a,b)=>a-b);
    while(people.length){
        if(people[0]+people[people.length-1]<=limit){
            people.shift();
            people.pop();
        }else{
            people.pop();
        }
        answer++;
    }
    return answer;
}