4W.5D-정렬문제

✏️문제 [수 정렬하기 2]

https://www.acmicpc.net/problem/10989

code

import sys
n = int(input())
l = []
for i in range(n):
    l.append(int(sys.stdin.readline()))
for i in sorted(l):
    sys.stdout.write(str(i)+'\n')

✏️문제[수 정렬하기 3]

https://www.acmicpc.net/problem/10989

code

import sys
n = int(sys.stdin.readline())
num_list = []
for _ in range(n):
  num_list.append(int(sys.stdin.readline()))
sorted_list = sorted(num_list)
for i in sorted_list:
    print(i)

import sys
n=int(input())
arr=[0]*10001
for_in range(n):
	num=int(sys.stdin.readline())
    arr[num]=arr[num]+1
for i in range(10001):
	if arr[i] !=0:
    	for_in range(arr[i]):
        	print(i)

✏️ 문제[통계학]

https://www.acmicpc.net/problem/2108

복습을 다시 해야겠다...못풀어서 참고블로그를 남긴다.
참고블로그:https://velog.io/@mygomi/TIL-38-DP로-푸는-통계학-백준-2108-python

code

import sys

from collections import Counter

r=sys.stdin.readline

n=int(r())
num_list =[]

for _ in range(n):
    num = int(r())
    num_list.append(num)

num_list.sort()

mode = Counter(num_list).most_common(2) 

print(round(sum(num_list)/len(num_list)))
print(num_list[len(num_list)//2])
print(mode[1][0] if len(mode)>1 and mode[0][1]==mode[1][1] else mode[0][0])
print(num_list[-1]-num_list[0])