Merge pull request #595 from gmlrude/main

[박희경] 84차 라이브 코테 제출

Author: github-actions[bot]

live8/test84/문제1/박희경.py

@@ -0,0 +1,39 @@
+import sys
+
+input = sys.stdin.readline
+
+
+def binary_search(arr, target):
+    start, end = 0, m - 1
+    cnt = 0
+    while start <= end:
+        mid = (start + end) // 2
+        if arr[mid] < target:   # 먹이가 작은 상황
+            cnt = mid + 1
+            start = mid + 1
+        else:                   # 먹이가 더 큰 상황
+            end = mid - 1
+    return cnt
+
+
+t = int(input())
+for _ in range(t):
+    n, m = map(int, input().split())
+    a = list(map(int, input().split()))
+    b = list(map(int, input().split()))
+
+    b.sort()
+    result = 0
+    for i in range(len(a)):
+        result += binary_search(b, a[i])
+    print(result)
+
+"""
+2
+5 3
+8 1 7 3 1
+3 6 1
+3 4
+2 13 7
+103 11 290 215
+"""

live8/test84/문제2/박희경.py

@@ -0,0 +1,34 @@
+import sys
+
+input = sys.stdin.readline
+
+
+def binary_search(cables):
+    start, end = 1, max(cables)
+    while start <= end:
+        mid = (start + end) // 2  # 반으로 자른 길이
+        cnt = 0
+        for cable in cables:
+            cnt += cable // mid
+        if cnt < n:  # 길이를 줄일 필요가 있음
+            end = mid - 1
+        else:
+            start = mid + 1     # 놓친 부분) 최대를 구해야 하니까..!
+    return end
+
+
+k, n = map(int, input().split())
+cm = []
+for _ in range(k):
+    cm.append(int(input()))
+
+print(binary_search(cm))
+
+
+"""
+4 11
+802
+743
+457
+539
+"""

live8/test84/문제3/박희경.py

@@ -0,0 +1,21 @@
+def solution(skill, skill_trees):
+    answer = 0
+
+    def is_possible(stack, skill):
+        i, j = 0, 0
+        while i < len(stack) and j < len(skill):
+            if stack[i] == skill[j]:
+                i += 1
+                j += 1
+            else:
+                return False
+        return True
+
+    for skills in skill_trees:
+        stack = []
+        for s in skills:
+            if s in skill:  # 순서가 중요한 스킬만
+                stack.append(s)
+        if is_possible(stack, skill):
+            answer += 1
+    return answer