Merge pull request #29 from Mingguriguri/minjeong

Minjeong / 5월 3주차 / 3문제

Author: learntosurf

minjeong/Greedy/2024-05-13-[PGS]-#체육복.py

@@ -0,0 +1,16 @@
+def solution(n, lost, reserve):
+    answer = 0
+    # 집합을 이용해서 중복값 제거
+    lost_set = set(lost) - set(reserve)
+    reserve_set = set(reserve) - set(lost)
+
+    # 빌려줄 수 있는지 판단
+    for can in list(reserve_set):
+        if can-1 in lost_set:
+            lost_set.remove(can-1)
+        elif can+1 in lost_set:
+            lost_set.remove(can+1)
+
+    # 정답은 전체 학생 수에서 잃어버린 학생 수를 빼는 것
+    answer = n - len(list(lost_set))
+    return answer

minjeong/Greedy/2024-05-15-[PGS]-#구명보트.py

@@ -0,0 +1,18 @@
+def solution(people, limit):
+    answer = 0
+
+    people.sort()
+    
+    left = 0
+    right = len(people)-1
+
+    while left <= right:
+        if people[left] + people[right] <= limit:
+            left += 1
+            right -= 1
+        else:
+            right -= 1
+            
+        answer += 1
+        
+    return answer

minjeong/Greedy/2024-05-17-[백준]-#1931-회의실배정.py

@@ -0,0 +1,23 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+meetings = [[0,0] for _ in range(n)]
+
+for i in range(n):
+    start, end = map(int, input().strip().split())
+    meetings[i][0] = start
+    meetings[i][1] = end
+
+# 끝나는 시간을 기준으로 정렬, 끝나는 시간이 같으면 시작 시간을 기준으로 정렬
+meetings.sort(key=lambda x: (x[1], x[0]))
+
+cnt = 0
+last_end_time = 0
+
+for start, end in meetings:
+    if start >= last_end_time:
+        cnt += 1
+        last_end_time = end
+    
+print(cnt)