[BaekJoon] 2910번 : 빈도 정렬 (Python)

코딩 1일 1문제! 오늘은 555일차 문제! 백준의 빈도 정렬 입니다.

2910번: 빈도 정렬

👨🏻‍💻 코드 ( Solution )

import sys

def frequency_sorting(numbers):
    order_cnt_dict = {}
    priority_dict = {}
    
    for idx, number in enumerate(numbers):
        if number not in order_cnt_dict.keys():
            order_cnt_dict[number] = [0, idx]
            
        order_cnt_dict[number][0] += 1
    
    order_cnt_items = order_cnt_dict.items()
    
    sorted_numbers = [num[0] for num in sorted(order_cnt_items, key=lambda x: (-x[1][0], x[1][1]))]
    
    for idx, num in enumerate(sorted_numbers):
        priority_dict[num] = idx
        
    numbers = sorted(numbers, key=(lambda x: priority_dict[x]))
    
    return " ".join(map(str, numbers))
        
    
    
        
if __name__ == "__main__":
    N, C = map(int, input().split())
    numbers = list(map(int, input().split()))
    
    print(frequency_sorting(numbers))

GitHub - SOMJANG/CODINGTEST_PRACTICE: 1일 1문제 since 2020.02.07