leetcode

0 class Solution {

1

2 typedef pair<int, int> pii;

3

4 public:

5 long long maximumImportance(int n, vector<vector<int>> &roads) {

6 vector<int> count(n, 0);

7

8 for (auto &e : roads) {

9 count[e[0]]++;

10 count[e[1]]++;

11 }

12

13 sort(count.begin(), count.end());

14

15 long long res = 0ll;

16 for (int i = 0; i < n; i++)

17 res += (i + 1ll) * count[i];

18

19 return res;

20 }

21 };