띵유로그

내 풀이 def solution(priorities, location): answer = 0 print_list=[] for i in range(len(priorities)): print_list.append((priorities[i], i)) cnt=0 while len(print_list)!=0 : job=print_list.pop(0) if len(print_list)!=0 and job[0] >= max(print_list)[0]: cnt=cnt+1 if job[1]==location: answer=cnt break elif len(print_list)==0: cnt=cnt+1 answer=cnt break else: print_list.append(job) return answer 그냥 머릿속에..