백준 2108: 통계학 (Python)

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

2108번: 통계학

 

from collections import Counter
import sys

n = int(sys.stdin.readline())
num = []

for i in range(n):
    num.append(int(sys.stdin.readline()))

print(round(sum(num)/n))

num.sort()
print(num[n//2])

counter = Counter(num).most_common()
if len(counter) > 1 and counter[0][1] == counter[1][1]:
    print(counter[1][0])
else:
    print(counter[0][0])

print(max(num)-min(num))

 

Counter 함수

- from collections import Counter

- 리스트 원소 개수 셈

- Counter(list).most_common() : 빈도값이 큰 순서대로 출력!