Programmers 구명보트
Updated:
Answer
import java.util.Arrays;
class Solution {
public int solution(int[] people, int limit) {
Arrays.sort(people);
int i = 0;
int j = people.length - 1;
while(i < j) {
if (people[i] + people[j] <= limit) {
i++;
}
j--;
}
return people.length - i;
}
}