Leetcode 2285. Maximum Total Importance of Roads

Given an undirected graph, assign unique labels 1..n to nodes to maximize the sum over edges of the sums of their endpoint labels — equivalently maximize sum(degree[node] * label[node]). The optimal greedy strategy is to assign the largest labels to the highest-degree nodes.