[자바스크립트/javascript] 프로그래머스 : 구명보트 (Lv.2) (그리디알고리즘,탐욕법)

https://school.programmers.co.kr/learn/courses/30/lessons/42885

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