[프로그래머스 Level 2] 구명보트

function solution(people, limit) {
    let cnt = 0;
 
    people.sort((a,b)=> b-a);
 
    for(let i = 0; i < people.length; i++){
        if(people[i] < limit && i < people.length-1 && people[i] + people.at(-1) <= limit){
            people.pop();
        }
        cnt++;
    }
 
    return cnt;
}