greedy1 Level2 구명보트 from collections import deque def solution(people, limit): count=0; cnt=0 people.sort() p = deque(people) k=len(people) i=0; j=k-1 while True: if(i==len(p)-1): break if(p[i]+p[j]1): i=0; j=len(p)-1 elif(len(p)==0): break else: p.pop(); j=len(p)-1; return k-count 2022. 2. 3. 이전 1 다음