황동근 7주차

source/HDG/220526/bj2230.md

@@ -0,0 +1,31 @@
+## 수 고르기
+
+답안을 참고했습니다
+
+python3 / 34692kb / 224ms
+
+```python
+import sys
+
+n, m = map(int, sys.stdin.readline().split())
+arr = []
+for i in range(n):
+    arr.append(int(sys.stdin.readline()))
+arr.sort()
+
+left, right = 0,0
+answer = sys.maxsize
+
+while left < n and right < n:
+    temp = arr[right] - arr[left]
+    if temp == m:
+        print(m)
+        exit()
+
+    if temp<m:
+        right+=1
+        continue
+    left += 1
+    answer = min(answer, temp)
+print(answer)
+```

source/HDG/220526/bj2473.md

@@ -0,0 +1,33 @@
+## 세 용액
+
+답안을 참고했습니다
+
+pypy3 / 114488kb / 184ms
+
+```python
+import sys
+
+n = int(sys.stdin.readline())
+arr = list(map(int, sys.stdin.readline().split()))
+arr.sort()
+
+answer = sys.maxsize
+
+for i in range(n-2):
+    start = i+1
+    end = n-1
+
+    while start < end:
+        temp = arr[i] + arr[start] + arr[end]
+        if abs(temp) <= answer:
+            answer = abs(temp)
+            result = [arr[i], arr[start], arr[end]]
+        if temp < 0:
+            start += 1
+        elif temp > 0:
+            end-=1
+        else:
+            break
+
+print(result[0], result[1], result[2])
+```

source/HDG/220526/bj3273.md

@@ -0,0 +1,27 @@
+## 두 수의 합
+
+양 끝에 포인터를 설정 한 후 풀었습니다
+
+python3 / 41620kb / 132ms
+
+```python
+import sys
+
+n = int(sys.stdin.readline())
+arr = list(map(int, sys.stdin.readline().split()))
+arr.sort()
+x = int(sys.stdin.readline())
+
+left, right = 0, n-1
+answer = 0
+
+while left < right:
+    if arr[left] + arr[right] == x:
+        answer +=1
+        right-=1
+    elif arr[left] + arr[right] > x:
+        right-=1
+    else:
+        left+=1
+print(answer)
+```