[프로그래머스] 10/06 (3)
·
카테고리 없음
[구명보트] My answer def solution(people, limit): answer = 0 people.sort() while(people!=[]): #wmin=min(people) wmin=people[0] #wmax=max(people) wmax=people[-1] if(wmin+wmax1): people=people[1:-1] #people.remove(wmin) #people.remove(wmax) else: people=people[1:] #people.remove(wmin) else: answer+=1 people=people[:-1] #people.remove(wmax) return answer ------------------------------------------------..