Maximum Total Importance of Roads LeetCode solution in C++

1
class Solution {
2
 public:
3
  long long maximumImportance(int n, vector<vector<int>> &roads) {
4
    vector<int> ind(n, 0);
5

6
    for (auto it : roads) {
7
      ind[it[0]]++;
8
      ind[it[1]]++;
9
    }
10

11
    priority_queue<long long> pq;
12
    long long val = n, ans = 0;
13

14
    for (int i = 0; i < n; i++) pq.push(ind[i]);
15

16
    while (!pq.empty()) {
17
      ans += pq.top() * val;
18
      val--;
19
      pq.pop();
20
    }
21
    return ans;
22
  }
23
};