Link to original title: Leetcode 2285. Maximum Total Importance of Roads
class Solution {
public:
long long maximumImportance(int n, vector<vector<int>>& roads) {
long long res=0;
vector<long long> degree(n);
for(auto x:roads)
{
degree[x[0]]++;
degree[x[1]]++;
}
sort(degree.begin(),degree.end());
int tmp=1;
for(auto x:degree)
{
res+=tmp*x;
tmp++;
}
return res;
}
};