From 490ff7a4964ec61e8cea3690553f43eeb0a25d30 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Thu, 31 Jul 2025 07:54:01 +0900
Subject: [PATCH] =?UTF-8?q?[20250731]=20BOJ=20/=20G3=20/=20=EC=B5=9C?=
 =?UTF-8?q?=EC=86=8C=EB=B9=84=EC=9A=A9=20=EA=B5=AC=ED=95=98=EA=B8=B0=202?=
 =?UTF-8?q?=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

---
 ...\352\265\254\355\225\230\352\270\260 2.md" | 89 +++++++++++++++++++
 1 file changed, 89 insertions(+)
 create mode 100644 "JHLEE325/202507/31 BOJ G3 \354\265\234\354\206\214\353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260 2.md"

diff --git "a/JHLEE325/202507/31 BOJ G3 \354\265\234\354\206\214\353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260 2.md" "b/JHLEE325/202507/31 BOJ G3 \354\265\234\354\206\214\353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260 2.md"
new file mode 100644
index 00000000..a29f6f91
--- /dev/null
+++ "b/JHLEE325/202507/31 BOJ G3 \354\265\234\354\206\214\353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260 2.md"	
@@ -0,0 +1,89 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static class Node implements Comparable<Node> {
+        int dest, cost;
+        Node(int dest, int cost) {
+            this.dest = dest;
+            this.cost = cost;
+        }
+
+        @Override
+        public int compareTo(Node o) {
+            return this.cost - o.cost;
+        }
+    }
+
+    static int n, m, start, destination;
+    static List<List<Node>> graph = new ArrayList<>();
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+
+        n = Integer.parseInt(br.readLine());
+        m = Integer.parseInt(br.readLine());
+
+        for (int i = 0; i <= n; i++) {
+            graph.add(new ArrayList<>());
+        }
+
+        for (int i = 0; i < m; i++) {
+            st = new StringTokenizer(br.readLine());
+            int s = Integer.parseInt(st.nextToken());
+            int d = Integer.parseInt(st.nextToken());
+            int c = Integer.parseInt(st.nextToken());
+            graph.get(s).add(new Node(d, c));
+        }
+
+        st = new StringTokenizer(br.readLine());
+        start = Integer.parseInt(st.nextToken());
+        destination = Integer.parseInt(st.nextToken());
+
+        dijkstra(start, destination);
+    }
+
+    static void dijkstra(int start, int end) {
+        int[] dist = new int[n + 1];
+        int[] prev = new int[n + 1];
+        Arrays.fill(dist, Integer.MAX_VALUE);
+        Arrays.fill(prev, -1);
+
+        PriorityQueue<Node> pq = new PriorityQueue<>();
+        dist[start] = 0;
+        pq.add(new Node(start, 0));
+
+        while (!pq.isEmpty()) {
+            Node cur = pq.poll();
+
+            if (dist[cur.dest] < cur.cost) continue;
+
+            for (Node next : graph.get(cur.dest)) {
+                if (dist[next.dest] > dist[cur.dest] + next.cost) {
+                    dist[next.dest] = dist[cur.dest] + next.cost;
+                    prev[next.dest] = cur.dest;
+                    pq.add(new Node(next.dest, dist[next.dest]));
+                }
+            }
+        }
+
+        List<Integer> path = new ArrayList<>();
+        int cur = end;
+        while (cur != -1) {
+            path.add(cur);
+            cur = prev[cur];
+        }
+        Collections.reverse(path);
+
+        System.out.println(dist[end]);
+        System.out.println(path.size());
+        for (int p : path) {
+            System.out.print(p + " ");
+        }
+    }
+}
+
+```