Merge pull request #64 from AlgoLeadMe/13-fnzksxl

13-fnzksxl

fnzksxl/README.md

@@ -14,4 +14,5 @@
 | 10차시 | 2024-03-07 | 구현 | [나무 재테크](https://www.acmicpc.net/problem/16235) | [#52](https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/52) |
 | 11차시 | 2024-03-10 | 투포인터 | [보석 쇼핑](https://school.programmers.co.kr/learn/courses/30/lessons/67258) | [#56](https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/56) |
 | 12차시 | 2024-03-13 | 벨만포드 | [타임머신](https://www.acmicpc.net/problem/11657) | [#](https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/58) |
+| 13차시 | 2024-03-20 | 다익스트라 | [서강그라운드](https://www.acmicpc.net/problem/14938) | [#64](https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/64) |
 ---

fnzksxl/다익스트라/서강그라운드.py

@@ -0,0 +1,46 @@
+import sys
+from heapq import *
+
+input = sys.stdin.readline
+
+def dijkstra(graph, start):
+    distance = [float('inf') for _ in graph]
+    distance[start] = 0
+    queue = []
+    heappush(queue, [distance[start], start])
+
+    while queue:
+        cur_dist, cur_dest = heappop(queue)
+
+        if distance[cur_dest] < cur_dist:
+            continue
+
+        for new_dest, new_dist in graph[cur_dest]:
+            dist = cur_dist + new_dist
+            if dist < distance[new_dest]:
+                distance[new_dest] = dist
+                heappush(queue, [dist, new_dest])
+
+    return distance
+
+
+items = []
+N, M, R = map(int, input().split())
+
+item_weight = list(map(int, input().split()))
+graph = [[] for _ in range(N+1)]
+
+for _ in range(R):
+    start, end, weight = map(int, input().split())
+    graph[start].append((end, weight))
+    graph[end].append((start, weight))
+
+for item in range(1, len(graph)):
+    result = dijkstra(graph, item)
+    can_get = 0
+    for i in range(len(result)):
+        if result[i] <= M:
+            can_get += item_weight[i-1]
+    items.append(can_get)
+
+print(max(items))