Min: 1월 4주차 문제풀이

01월/4주차/[BOJ] 배/Min.java

@@ -0,0 +1,53 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+import java.util.StringTokenizer;
+
+public class Min {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int N = Integer.parseInt(br.readLine());
+        StringTokenizer str = new StringTokenizer(br.readLine());
+        List<Integer> crane = new ArrayList<>();
+        for(int i = 0; i < N; i++) {
+            crane.add(Integer.parseInt(str.nextToken()));
+        }
+        Collections.sort(crane, Collections.reverseOrder());
+
+        int M = Integer.parseInt(br.readLine());
+        List<Integer> box = new ArrayList<>();
+        str = new StringTokenizer(br.readLine());
+        for(int i = 0; i < M; i++) {
+            box.add(Integer.parseInt(str.nextToken()));
+        }
+        Collections.sort(box, Collections.reverseOrder());
+
+        if(crane.get(0) < box.get(0)) {
+            System.out.println(-1);
+            return;
+        }
+
+        int answer = 0;
+        while (!box.isEmpty()) {
+            int idx = 0;
+
+            for (int i = 0; i < crane.size(); i++) {
+                while (idx < box.size()) {
+                    if (box.get(idx) <= crane.get(i)) {
+                        box.remove(idx);
+                        break;
+                    }
+                    idx++;
+                }
+            }
+
+            answer++;
+        }
+
+        System.out.println(answer);
+
+    }
+}

01월/4주차/[BOJ] 좋은 구간/Min.java

@@ -0,0 +1,49 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+
+class Min {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int L = Integer.parseInt(br.readLine());
+        int[] arr = new int[L];
+        StringTokenizer str = new StringTokenizer(br.readLine());
+
+        for(int i = 0; i < L; i++) {
+            arr[i] = Integer.parseInt(str.nextToken());
+        }
+        Arrays.sort(arr);
+
+        int n = Integer.parseInt(br.readLine());
+        int answer = 0;
+        int min = 1;
+        int max = 0;
+        int idx = 0;
+
+        while(idx < L) {
+            if(arr[idx] == n) {
+                System.out.println(answer);
+                return;
+            }
+            if(arr[idx] < n) {
+                min = arr[idx] + 1;
+            }
+            if(arr[idx] > n) {
+                max = arr[idx] - 1;
+                break;
+            }
+            idx += 1;
+        }
+
+        for(int i = min; i <= n; i++) {
+            for(int j = n; j <= max; j++) {
+                answer += 1;
+            }
+        }
+
+        System.out.println(answer - 1);
+    }
+}

01월/4주차/[PRGRMS] 택배 배달과 수거하기/Min.java

@@ -0,0 +1,19 @@
+class Min {
+    public long solution(int cap, int n, int[] deliveries, int[] pickups) {
+        long answer = 0;
+        int d = 0;
+        int p = 0;
+
+        for(int i = n - 1; i >= 0; i--) {
+            d += deliveries[i];
+            p += pickups[i];
+
+            while(d > 0 || p > 0) {
+                d -= cap;
+                p -= cap;
+                answer += (i + 1) * 2;
+            }
+        }
+        return answer;
+    }
+}