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

 

[문제]

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

프로그래머스

 

 

[소스 코드[

import java.util.*;                                                                                            
class Solution {
    public int solution(int[] people, int limit) {
        int answer = 0;
        int len = people.length;
        Arrays.sort(people);
        int start = 0;
        int end = len - 1;
        while(start<=end){
            if(people[start]+people[end]<=limit){
                start++;
            }
            end--;
            answer++;
        }
        return answer;
    }
}