class Solution:

    def maximumImportance(self, n: int, roads: List[List[int]]) -> int:

        visit = [0 for _ in range(n)]

        for u, v in roads:

            visit[u] += 1

            visit[v] += 1

        return sum([(i+1)*v for i, v in enumerate(sorted(visit))])


간단한 카운팅 후 정렬하는 문제