[20250712] BOJ / G5 / 최소비용구하기 / 이준희 #446
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/1916
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
도시의 개수와 도시를 이동하는 버스의 정보가 주어졌을 때
주어지는 시작도시로부터 목적지도시까지의 최소비용을 구하는 문제입니다
🔍 풀이 방법
우선순위큐를 이용한 다익스트라를 사용하여 풀었습니다.
⏳ 회고
커밋 날짜를 잘 확인합시다