lv1_예산_소팅 def solution(d, budget): d.sort(reverse = True) cnt = 0 while budget > 0 and d != []: budget -= d.pop() cnt += 1 if budget < 0: cnt -= 1 break return cnt lv2_기능개발 ⭐ 큐를 이용하는 문제! 이지만 포인터로 풀어본 문제! import math def solution(progresses, speeds): n = len(speeds) days = [0] * n for i in range(n): days[i] = math.ceil((100 - progresses[i]) / speeds[i]) print(days) dist = [] start = 0 end = 0 whi..