코딩하는 등산가

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.StringTokenizer; public class Back_1713 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedRe..

문제 입출력 문제풀이 import java.util.*; class Solution { public int[] solution(int brown, int yellow) { int[] answer = new int[2]; // x*2+y*2=brown+4; // (x-2)*(y-2)=yello; // xy-2*x-2*y+4=yello; // xy=yello+brown; int k = yellow + brown; int j = 0; for(int i = 1 ; i

문제 입력&출력 문제풀이 import java.util.*; class Solution { public String solution(int[] numbers) { String answer = ""; String[] tmp = new String[numbers.length]; for(int i = 0 ; i ( (s2+s1).compareTo(s1+s2) )); if(Integer.parseInt(tmp[0])==0){ return "0"; } for(int i = 0 ; i < tmp.length;i++){ answer+=tmp[i]; } return..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.math.BigInteger; import java.util.StringTokenizer; public class Back_2824 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BigInteger a = new..

문제 제한 사항 및 입출력 문제풀이 import java.util.*; class Solution { public int[] solution(String[] operations) { int[] answer = new int[2]; PriorityQueue pq1 = new PriorityQueue(); PriorityQueue pq2 = new PriorityQueue(Collections.reverseOrder()); String[] tmp; for(int i = 0 ; i < operations.length;i++){ tmp = operations[i].split(" "); if(pq1.size()==0 && tmp[0].equals("D"))continue; if(tmp[0].equals("I"))..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Back_9461 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int testCase = Integer.parseInt(br.readLine()); long [] arr = new long[101]; arr[..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; 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 Back_5635 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedReader(new InputStreamReader(Sy..

문제 설명 제한사항 입력&출력 문제풀이 import java.util.*; class Solution { static class job { int request; int time; public job(int request, int time) { this.request = request; this.time = time; } } public int solution(int[][] jobs) { int answer = 0; LinkedList works = new LinkedList(); PriorityQueue pq = new PriorityQueue(new Comparator() { @Override public int compare(job i, job j) { return i.time - j.time; }..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Back_3107 { static String [] answer = {"0000","0000","0000","0000","0000","0000","0000","0000"}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb; S..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Back_1292 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int A = Integ..