[23.01.30/Python] 예산

Author: par3k

.gitignore

@@ -3,3 +3,9 @@
 .idea/workspace.xml
 .idea/misc.xml
 .idea/codingtest.iml
+*.class
+*.xml
+BOJ_JAVA/.idea/misc.xml
+BOJ_JAVA/.DS_Store
+.DS_Store
+theory_Python/.DS_Store

Python_BOJ_2023/2512.py

@@ -0,0 +1,27 @@
+# 예산
+n = int(input())
+arra = list(map(int, input().split()))
+m = int(input())
+arra.sort()
+
+def binary_search(arr):
+    start = 0
+    end = max(arr)
+    
+    while start <= end:
+        mid = (start + end) // 2
+        print(start, end, mid)
+        cnt = 0
+        for i in range(n):
+            if arr[i] >= mid:
+                cnt += mid
+            else:
+                cnt += arr[i]
+        if cnt <= m:
+            start = mid + 1
+        else:
+            end = mid - 1
+    return end
+
+answer = binary_search(arra)
+print(answer)