![]()
문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/42579 제한 사항 입출력 예 풀이import java.util.PriorityQueue;import java.util.ArrayList;import java.util.HashMap;import java.util.Comparator;import static java.util.Map.Entry;import static java.util.AbstractMap.SimpleEntry;class Solution { public int[] solution(String[] genres, int[] plays) { ArrayList answer = new ArrayList();..
![]()
문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/12927 제한 사항 입출력 예 풀이import java.util.PriorityQueue;class Solution { public long solution(int n, int[] works) { long answer = 0; PriorityQueue result = new PriorityQueue((i, j) -> j - i); for (int work : works) result.add(work); while (n-- > 0) result.add(result.poll() - 1); for (int..
![]()
문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/258709 제한 사항 입출력 예 풀이import java.util.List;import java.util.ArrayList;import java.util.Map;import java.util.HashMap;import java.util.PriorityQueue;import static java.util.Map.Entry;class Solution { int[] answer = {}; int max = 0; public int[] solution(int[][] dice) { selectDices(new ArrayList(), dice, -1, di..
