[Programmers] (탐욕법[Greedy]) Lv 2. 구명보트

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

프로그래머스

 

function solution(people, limit) {
    var answer = 0;

    people.sort((a, b) => b - a);
    for (let i = 0, j = people.length - 1; i <= j; ++i) {
        if (limit >= people[i] + people[j]) {
            ++answer;
            --j;
        } else ++answer;
    }

    return answer;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/42885.%E2%80%85%EA%B5%AC%EB%AA%85%EB%B3%B4%ED%8A%B8

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드