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

import java.util.*;

class Solution {
    public int solution(int[] people, int limit) {
        int count = 0;  // 구명보트 개수
        Arrays.sort(people);
        int left = 0;
        int right = people.length - 1;
        
        while (left <= right) {
            if (people[left] + people[right] <= limit) {
                left++;
                right--;
                count++;
            } else {
                right--;
                count++;
            }
        }
        return count;
    }
}