From daff8ea4b09c7cb649599ce62d348dadbdd3fa1a Mon Sep 17 00:00:00 2001
From: longrunpc <pcjmo4050@gmail.com>
Date: Sun, 12 Apr 2026 23:43:56 +0900
Subject: [PATCH] =?UTF-8?q?Solve(disjoint=5Fset):=20BOJ=2016562=20"?=
 =?UTF-8?q?=EC=B9=9C=EA=B5=AC=EB=B9=84"=20=EB=AC=B8=EC=A0=9C=ED=92=80?=
 =?UTF-8?q?=EC=9D=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 boj/solved/disjoint_set/16562/Main.java | 66 +++++++++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 boj/solved/disjoint_set/16562/Main.java

diff --git a/boj/solved/disjoint_set/16562/Main.java b/boj/solved/disjoint_set/16562/Main.java
new file mode 100644
index 0000000..f19f926
--- /dev/null
+++ b/boj/solved/disjoint_set/16562/Main.java
@@ -0,0 +1,66 @@
+import java.io.*;
+import java.util.*;
+
+class Main {
+    static int n, m, k;
+    static int[] w;
+    static int[] friends;
+    public static void main(String[] args) throws IOException {
+        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());
+        friends = new int[n+1];
+        w = new int[n+1];
+        st = new StringTokenizer(br.readLine());
+        for(int i = 1;i<=n;i++) {
+            friends[i] = i;
+            w[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());
+            union(a, b);
+        }
+
+        int res = 0;
+        for(int i = 1;i<=n;i++) {
+            if(find(i) == i) {
+                res += w[i];
+            }
+        }
+
+        if (res > k) {
+            System.out.println("Oh no");
+        }
+        else {
+            System.out.println(res);
+        }
+    }
+
+    public static int find(int id) {
+        if (friends[id] == id) {
+            return id;
+        }
+        return friends[id] = find(friends[id]);
+    }
+
+    public static void union(int a, int b) {
+        int friendA = find(a);
+        int friendB = find(b);
+        if (friendA == friendB) {
+            return;
+        }
+
+        if (w[friendA] > w[friendB]) {
+            friends[friendA] = friendB;
+        }
+        else {
+            friends[friendB] = friendA;
+        }
+    }
+}
\ No newline at end of file