Mun: 3월 2주차 문제 풀이

03월/2주차/[BOJ] 부분 문자열/Mun.java

@@ -0,0 +1,37 @@
+import java.io.*;
+import java.util.*;
+
+public class Mun {
+	public static void main(String[] args) throws IOException {
+	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	    StringBuilder sb = new StringBuilder("");
+	    StringTokenizer st;
+	    String str = br.readLine();
+	    while(str != null && !str.equals("")) {
+	        st = new StringTokenizer(str, " ");
+	        String s = st.nextToken();
+	        String t = st.nextToken();
+	        sb.append(isCombine(s.toCharArray(), t.toCharArray())).append("\n");
+	        str = br.readLine();
+	    }
+	    System.out.print(sb.toString());
+	}
+
+	private static String isCombine(char[] s, char[] t) {
+	    int start = 0;
+	    for(char c : s) {
+	        boolean ex = false;
+	        for(int i=start;i<t.length;i++) {
+	            if(t[i] == c) {
+	                start = i+1;
+	                ex = true;
+	                break;
+	            }
+	        }
+	        if(!ex) {
+	            return "No";
+	        }
+	    }
+	    return "Yes";
+	}
+}

03월/2주차/[BOJ] 최소 회의실 개수/Mun.java

@@ -0,0 +1,28 @@
+import java.io.*;
+import java.util.*;
+
+public class Mun {
+	public static void main(String[] args) throws IOException {
+	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	    int N = Integer.parseInt(br.readLine());
+	    int[][] time = new int[N][2];
+	    for(int i=0;i<N;i++) {
+	        String[] input = br.readLine().split(" ");
+	        time[i][0] = Integer.parseInt(input[0]);
+	        time[i][1] = Integer.parseInt(input[1]);
+	    }
+	    Arrays.sort(time, (o1, o2) -> {
+	        return (o1[0] == o2[0]) ? o1[1] - o2[1] : o1[0] - o2[0];
+	    });
+	    PriorityQueue<Integer> que = new PriorityQueue<>();
+	    que.add(time[0][1]);
+	    for(int i=1;i<N;i++) {
+	        if(que.peek() <= time[i][0]) {
+	            que.poll();
+	        }
+	        que.add(time[i][1]);
+	    }
+	    System.out.print(que.size());
+	}
+
+}

03월/2주차/[BOJ] 카우버거/Mun.java

@@ -0,0 +1,33 @@
+import java.io.*;
+import java.util.*;
+
+public class Mun {
+	public static void main(String[] args) throws IOException {
+	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	    String[] input = br.readLine().split(" ");
+	    int B = Integer.parseInt(input[0]);
+	    int C = Integer.parseInt(input[1]);
+	    int D = Integer.parseInt(input[2]);
+	    ArrayList<Integer>[] list = new ArrayList[3];
+	    for(int i=0;i<3;i++) {
+	        list[i] = new ArrayList<>();
+	    }
+	    int setNum = Math.min(B, Math.min(C, D));
+	    long sum = 0;
+	    long set = 0;
+	    for(int i=0;i<3;i++) {
+	        String[] price = br.readLine().split(" ");
+	        for(int j=0;j<price.length;j++) {
+	            int p = Integer.parseInt(price[j]);
+	            list[i].add(p);
+	            sum+=p;
+	        }
+	        Collections.sort(list[i], Collections.reverseOrder());
+	        for(int j=0;j<setNum;j++) {
+	            set+=list[i].get(j);
+	        }
+	    }
+	    System.out.println(sum);
+	    System.out.print(sum - set / 10);
+	}
+}