From a34dc2e1f103160ae7885e4005295659c11b7890 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Wed, 20 Aug 2025 11:05:08 +0900
Subject: [PATCH] =?UTF-8?q?[20250820]=20BOJ=20/=20G4=20/=20=EA=B0=80?=
 =?UTF-8?q?=EC=9A=B4=EB=8D=B0=EC=97=90=EC=84=9C=20=EB=A7=8C=EB=82=98=20/?=
 =?UTF-8?q?=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 \353\247\214\353\202\230\352\270\260.md" | 82 +++++++++++++++++++
 1 file changed, 82 insertions(+)
 create mode 100644 "JHLEE325/202508/20 BOJ G4 \352\260\200\354\232\264\353\215\260\354\204\234 \353\247\214\353\202\230\352\270\260.md"

diff --git "a/JHLEE325/202508/20 BOJ G4 \352\260\200\354\232\264\353\215\260\354\204\234 \353\247\214\353\202\230\352\270\260.md" "b/JHLEE325/202508/20 BOJ G4 \352\260\200\354\232\264\353\215\260\354\204\234 \353\247\214\353\202\230\352\270\260.md"
new file mode 100644
index 00000000..b1385b52
--- /dev/null
+++ "b/JHLEE325/202508/20 BOJ G4 \352\260\200\354\232\264\353\215\260\354\204\234 \353\247\214\353\202\230\352\270\260.md"	
@@ -0,0 +1,82 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int n, m, k;
+    static int[][] map;
+    static final int INF = 987654321;
+
+    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());
+
+        map = new int[n][n];
+        for (int i = 0; i < n; i++) {
+            Arrays.fill(map[i], INF);
+            map[i][i] = 0;
+        }
+
+        for (int i = 0; i < m; i++) {
+            st = new StringTokenizer(br.readLine());
+            int from = Integer.parseInt(st.nextToken()) - 1;
+            int to = Integer.parseInt(st.nextToken()) - 1;
+            int cost = Integer.parseInt(st.nextToken());
+            if (cost < map[from][to]) map[from][to] = cost;
+        }
+
+        for (int k = 0; k < n; k++) {
+            for (int i = 0; i < n; i++) {
+                if (map[i][k] == INF) continue;
+                for (int j = 0; j < n; j++) {
+                    if (map[k][j] == INF) continue;
+                    map[i][j] = Math.min(map[i][j], map[i][k] + map[k][j]);
+                }
+            }
+        }
+
+        k = Integer.parseInt(br.readLine());
+        int[] friend = new int[k];
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < k; i++) {
+            friend[i] = Integer.parseInt(st.nextToken()) - 1;
+        }
+
+        int best = INF;
+        ArrayList<Integer> ans = new ArrayList<>();
+
+        for (int v = 0; v < n; v++) {
+            int worst = 0;
+            boolean ok = true;
+            for (int s : friend) {
+                if (map[s][v] == INF || map[v][s] == INF) {
+                    ok = false;
+                    break;
+                }
+                worst = Math.max(worst, map[s][v] + map[v][s]);
+            }
+            if (!ok) continue;
+
+            if (worst < best) {
+                best = worst;
+                ans.clear();
+                ans.add(v + 1);
+            } else if (worst == best) {
+                ans.add(v + 1);
+            }
+        }
+
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < ans.size(); i++) {
+            if (i > 0) sb.append(' ');
+            sb.append(ans.get(i));
+        }
+        System.out.println(sb.toString());
+    }
+}
+
+```