이 문제는 N의 최대 개수가 10,000,000으로 매우 크기 때문에 O(nlogn)보다 더 빠른 알고리즘이 필요하다.
문제에서 주어지는 숫자의 크기가 10,000보다 작다는 것을 바탕으로 기수정렬과 함께 많이 사용되는 계수 정렬(counting sort)을 사용하여 문제를 해결하면 된다.
정렬하는 데이터의 개수가 너무 많은 경우 기수 정렬 알고리즘을 활용하는 것이 좋을 때도 있다.
# 수 정렬하기3
import sys
input = sys.stdin.readline
arr = [0] * 10001
N = int(input())
for _ in range(N):
arr[int(input())] += 1
for i in range(1, 10001):
while arr[i] != 0:
print(i)
arr[i] -= 1
https://melonplaymods.com/2023/06/11/large-screen-mobile-phone-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/silent-guard-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/lightsabers-like-in-star-wars-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/motorcycle-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/iron-man-tony-stark-mod-for-melon-playground/
https://melonplaymods.com/2023/06/10/pantera-negra-mod-for-melon-playground/
https://melonplaymods.com/2023/06/10/otachi-kaiju-mod-for-melon-playground/
https://melonplaymods.com/2023/06/10/people-sandbox35-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/two-hammers-mod-for-melon-playground/
https://melonplaymods.com/2023/06/10/special-police-van-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/torture-tool-3-mod-for-melon-playground/
https://melonplaymods.com/2023/06/10/seek-chan-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/crusader-crossbow-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/ordinary-tank-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/shelley-gun-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/spear-mod-for-melon-playground/
https://melonplaymods.com/2023/06/10/percys-predicament-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/kids-mod-for-melon-playground-3/
https://melonplaymods.com/2023/06/10/giant-speakerman-mod-for-melon-playground/
https://melonplaymods.com/2023/06/11/brawl-stars-pack-characters-mod-for-melon-playground/