수 고르기 풀이

Author: saebyeok0306

BAEKJOON/3Gold/수 고르기.py

@@ -0,0 +1,24 @@
+# 
+# https://www.acmicpc.net/problem/2230
+
+import sys
+input = sys.stdin.readline
+
+N,M = map(int, input().split())
+nums = [int(input()) for _ in range(N)]
+nums.sort()
+
+end = 0
+ans = nums[N-1]-nums[0]
+
+for start in range(N):
+    while end < N:
+        diff = nums[end]-nums[start]
+        if diff >= M:
+            ans = min(ans, diff)
+            break
+        else:
+            end += 1
+
+print(ans)
+

BAEKJOON/3Gold/횡단보도.py

@@ -1,4 +1,4 @@
-# 
+# 그래프 이론, 최단 경로, 데이크스트라
 # https://www.acmicpc.net/problem/24042
 
 """