Leet Code Daily 2024-06-28 - Maximum Total Importance of Roads

class Solution {
public:
    long long maximumImportance(int n, vector<vector<int>>& roads) {

        vector<int> degree(n, 0);
        for (const auto& road : roads) {
            degree[road[0]]++;
            degree[road[1]]++;
        }

        sort(degree.begin(), degree.end());

        long long ret = 0;
        for (int i = 0; i < n; i++) {
            ret += (long long)(i + 1) * degree[i];
        }
        return ret;
    }
};