From 8aa05d059b5fe8c8c2fe652e8c908731fc6b2883 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EA=B0=95=EC=8B=A0=EC=A7=80?=
 <101992179+ksinji@users.noreply.github.com>
Date: Mon, 1 Dec 2025 23:40:26 +0900
Subject: [PATCH] =?UTF-8?q?[20251201]=20BOJ=20/=20G5=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=20/?=
 =?UTF-8?q?=20=EA=B0=95=EC=8B=A0=EC=A7=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...1 \352\265\254\355\225\230\352\270\260.md" | 78 +++++++++++++++++++
 1 file changed, 78 insertions(+)
 create mode 100644 "ksinji/202512/01 BOJ \354\265\234\354\206\214\353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260.md"

diff --git "a/ksinji/202512/01 BOJ \354\265\234\354\206\214\353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260.md" "b/ksinji/202512/01 BOJ \354\265\234\354\206\214\353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260.md"
new file mode 100644
index 00000000..27b46c04
--- /dev/null
+++ "b/ksinji/202512/01 BOJ \354\265\234\354\206\214\353\271\204\354\232\251 \352\265\254\355\225\230\352\270\260.md"	
@@ -0,0 +1,78 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static class City implements Comparable<City> {
+        int number;
+        int cost;
+
+        City(int number, int cost) {
+            this.number = number;
+            this.cost = cost;
+        }
+
+        @Override
+        public int compareTo(City other) {
+            return Integer.compare(this.cost, other.cost);
+        }
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+
+        int n = Integer.parseInt(br.readLine());
+        int m = Integer.parseInt(br.readLine()); 
+
+        List<City>[] graph = new ArrayList[n + 1];
+        for (int i = 1; i <= n; i++) {
+            graph[i] = new ArrayList<>();
+        }
+
+        for (int i = 0; i < m; i++) {
+            st = new StringTokenizer(br.readLine());
+            int from = Integer.parseInt(st.nextToken());
+            int to   = Integer.parseInt(st.nextToken());
+            int cost = Integer.parseInt(st.nextToken());
+
+            graph[from].add(new City(to, cost));
+        }
+
+        st = new StringTokenizer(br.readLine());
+        int start = Integer.parseInt(st.nextToken());
+        int end   = Integer.parseInt(st.nextToken());
+
+        int[] dist = new int[n + 1];
+        boolean[] visited = new boolean[n + 1];
+        Arrays.fill(dist, Integer.MAX_VALUE);
+        dist[start] = 0;
+
+        PriorityQueue<City> pq = new PriorityQueue<>();
+        pq.offer(new City(start, 0));
+
+        while (!pq.isEmpty()) {
+            City cur = pq.poll();
+            int now = cur.number;
+            int costSoFar = cur.cost;
+
+            if (visited[now]) continue;
+            visited[now] = true;
+
+            for (City next : graph[now]) {
+                int nextCity = next.number;
+                int nextCost = costSoFar + next.cost;
+
+                if (!visited[nextCity] && dist[nextCity] > nextCost) {
+                    dist[nextCity] = nextCost;
+                    pq.offer(new City(nextCity, nextCost));
+                }
+            }
+        }
+
+        System.out.println(dist[end]);
+    }
+}
+
+```