From 3e4cedcc5f24575756cdf32ded8d216db322e31b Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Wed, 10 Dec 2025 13:57:03 +0900
Subject: [PATCH] =?UTF-8?q?[20251210]=20BOJ=20/=20G4=20/=20=EC=B9=9C?=
 =?UTF-8?q?=EA=B5=AC=EB=B9=84=20/=20=EC=9D=B4=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4 \354\271\234\352\265\254\353\271\204.md" | 78 +++++++++++++++++++
 1 file changed, 78 insertions(+)
 create mode 100644 "JHLEE325/202512/10 BOJ G4 \354\271\234\352\265\254\353\271\204.md"

diff --git "a/JHLEE325/202512/10 BOJ G4 \354\271\234\352\265\254\353\271\204.md" "b/JHLEE325/202512/10 BOJ G4 \354\271\234\352\265\254\353\271\204.md"
new file mode 100644
index 00000000..a22b4789
--- /dev/null
+++ "b/JHLEE325/202512/10 BOJ G4 \354\271\234\352\265\254\353\271\204.md"	
@@ -0,0 +1,78 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int N, M, K;
+    static int[] cost;
+    static List<Integer>[] graph;
+    static boolean[] visited;
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+        K = Integer.parseInt(st.nextToken());
+
+        cost = new int[N + 1];
+        visited = new boolean[N + 1];
+        graph = new ArrayList[N + 1];
+
+        for (int i = 1; i <= N; i++) graph[i] = new ArrayList<>();
+
+        st = new StringTokenizer(br.readLine());
+        for (int i = 1; i <= N; i++) {
+            cost[i] = Integer.parseInt(st.nextToken());
+        }
+
+        for (int i = 0; i < M; i++) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            graph[a].add(b);
+            graph[b].add(a);
+        }
+
+        int totalCost = 0;
+
+        for (int i = 1; i <= N; i++) {
+            if (!visited[i]) {
+                int minCost = bfs(i);
+                totalCost += minCost;
+
+                if (totalCost > K) {
+                    System.out.println("Oh no");
+                    return;
+                }
+            }
+        }
+
+        System.out.println(totalCost);
+    }
+
+    static int bfs(int start) {
+        Queue<Integer> q = new ArrayDeque<>();
+        q.add(start);
+        visited[start] = true;
+
+        int minCost = cost[start];
+
+        while (!q.isEmpty()) {
+            int cur = q.poll();
+            minCost = Math.min(minCost, cost[cur]);
+
+            for (int next : graph[cur]) {
+                if (!visited[next]) {
+                    visited[next] = true;
+                    q.offer(next);
+                }
+            }
+        }
+        return minCost;
+    }
+}
+
+```