[level 2] 구명보트 - 42885

문제 링크

프로그래머스

import java.util.Arrays;

class Solution {

    public int solution(int[] people, int limit) {
       int answer = 0;
       
       Arrays.sort(people);
       
       int light = 0, heavy = people.length - 1;
       while (light < heavy) {
          if(people[light] <= limit - people[heavy--]) {
             light++;
          }
          answer++;
       }

       return light == heavy? answer + 1 : answer;
    }
}