GOMNARU

https://school.programmers.co.kr/learn/courses/30/lessons/12927?language=javaimport java.util.*;class Solution { public long solution(int n, int[] works) { PriorityQueue pq = new PriorityQueue(Collections.reverseOrder()); for (int i = 0; i 0) { int temp = pq.poll(); if (temp > 0) temp--; pq.offer(temp); } long answe..

https://school.programmers.co.kr/learn/courses/30/lessons/42884 import java.util.*;class Solution { public int solution(int[][] routes) { // 진출 지점을 기준으로 오름차순 정렬하기 Arrays.sort(routes, (a, b) -> Integer.compare(a[1], b[1])); int answer = 1; int currentCam = routes[0][1]; for (int i = 1; i  이 코드의 주요 특징과 최적화 포인트는 다음과 같습니다: 1. 그리디 알고리즘 사용:..

https://school.programmers.co.kr/learn/courses/30/lessons/172927 import java.util.*;class Solution { public int solution(int[] picks, String[] minerals) { int answer = 0; int totalPicks = picks[0] + picks[1] + picks[2]; PriorityQueue pq = new PriorityQueue((a, b) -> b[2] - a[2]); // "돌 곡괭이를 썼을 때의 피로도"를 기준으로 내림차순 저장 // 왜냐하면 돌 곡괭이만 광물 종류를 식별해주고, "어려운 광물이 많은 순서..