1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
function solution(people, limit) {
    var answer = 0;

    const sortedPeople = people.sort((a, b) => b - a);

    var first = 0;
    var second = sortedPeople.length - 1;
    while (first <= second) {
        if (sortedPeople[first] <= limit / 2) {
            answer += Math.ceil((second + 1 - first) / 2);
            break;
        }

        answer++;
        switch (sortedPeople[first] + sortedPeople[second] <= limit) {
            case true:
                first++;
                second--;
                break;
            case false:
                first++;
                break;
        }
    }

    return answer;
}