https://www.acmicpc.net/problem/17551. 알고리즘! 생각해보자1) 숫자-> String 변환2) 정렬3) String -> 숫자 변환하여 출력2. 해결 코드import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.ArrayList;import java.util.Collections;import java.util.StringTokenizer;public class Main { public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedRead..

https://www.acmicpc.net/problem/115571. 알고리즘! 생각해보자1) implements Comparable2) Collections.sort()3) 정렬된 것 중에 마지막(max) 리턴2. 해결 코드import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.ArrayList;import java.util.Collections;class YJJ implements Comparable{ private String school; private int sul; public String getSchool() {return school;} public YJ..

https://www.acmicpc.net/problem/11004 1. 알고리즘! 생각해보자1) priority queue 에 넣기2) K번째까지 poll 하기2. 해결 코드import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int N = Integer.parseInt(st.nextToken()); int K =..

https://school.programmers.co.kr/learn/courses/30/lessons/42626?language=java 1. 알고리즘! 생각해보자1) priority queue 에 넣기2) 반복문 조건: queue.peek() - 스코빌지수 계산해서 queue.add()2. 해결 코드import java.util.PriorityQueue;class Solution { public int solution(int[] scoville, int K) { int answer = 0; PriorityQueue que = new PriorityQueue(); for (int i = 0; i 3. 레퍼런스 [프로그래머스] 더 맵게_JAVA문제..