[Programmers] 구명보트 - Java

https://school.programmers.co.kr/learn/courses/30/lessons/42885?language=java 

프로그래머스

---

1. 문제

 

2. 풀이

 

3. 코드

import java.io.*;
import java.util.*;

class Solution {
    public int solution(int[] people, int limit) {
        int ans = 0;
        int left = 0;
        int right = people.length-1;
        
        //내림차순 정렬
        PriorityQueue<Integer> pq = new PriorityQueue<> ((o1,o2)->o2-o1);
        for (int i : people) {
            pq.offer(i);
        }
        Integer[] pp = new Integer[people.length];
        int i=0;
        while (!pq.isEmpty()) {
            pp[i++] = pq.poll();
        }
        
        while (left <= right) {
            if (left == right) {
                ans++;
                break;
            }
            
            int sum = pp[left] + pp[right];
            if (sum > limit) {
                left++;
            }
            else {
                left++;
                right--;
            }
            ans++;
        }
        
        return ans;
    }
}

4. 사담