백준 2805번 나무 자르기

문제 링크: https://www.acmicpc.net/problem/2805

Author: skysign

백준 2805번 나무 자르기/main.py

@@ -0,0 +1,36 @@
+import sys
+from typing import List
+
+
+def solve():
+    N, M = map(int, sys.stdin.readline().strip().split(' '))
+    dt: List[int] = list(map(int, sys.stdin.readline().strip().split(' ')))
+    answer = 0
+    high = max(dt)
+    low = 0
+
+    while low <= high:
+        mid = (low + high) // 2
+        sm = sum_wood_length(dt, mid)
+
+        if sm >= M:
+            low = mid + 1
+            answer = mid
+        else:
+            high = mid - 1
+
+    print(answer)
+
+
+def sum_wood_length(dt: List[int], h: int):
+    rtn = 0
+
+    for wood in dt:
+        if wood > h:
+            rtn += (wood - h)
+
+    return rtn
+
+
+if __name__ == '__main__':
+    solve()

백준 2805번 나무 자르기/test1.txt

@@ -0,0 +1,2 @@
+4 7
+20 15 10 17

백준 2805번 나무 자르기/test1_answer.txt

@@ -0,0 +1 @@
+15

백준 2805번 나무 자르기/test2.txt

@@ -0,0 +1,2 @@
+5 20
+4 42 40 26 46

백준 2805번 나무 자르기/test2_answer.txt

@@ -0,0 +1 @@
+36

백준 2805번 나무 자르기/test_main.py

@@ -0,0 +1,26 @@
+import sys
+from pathlib import Path
+from unittest import TestCase
+from main import solve
+
+
+class Test(TestCase):
+    def my_solve(self, testcase_input):
+        sys.stdin = open(testcase_input, 'r')
+        stdout = sys.stdout
+        sys.stdout = open('stdout.txt', 'w')
+        solve()
+        sys.stdout.close()
+        sys.stdout = stdout
+
+    def test_solve(self, testcase_number: str):
+        self.my_solve('test' + testcase_number + '.txt')
+        self.assertEqual(
+            Path('test' + testcase_number + '_answer.txt').read_text().strip(),
+            Path('stdout.txt').read_text().strip())
+
+    def test1_solve(self):
+        self.test_solve('1')
+
+    def test1_solve(self):
+        self.test_solve('2')