Jump Game VI LeetCode solution in C++

1
#define pii pair<int, int>
2
class Solution {
3
 public:
4
  int maxResult(vector<int> &nums, int k) {
5
    int n = nums.size();
6
    int score[n];
7
    priority_queue<pii> pq;
8

9
    for (int i = n - 1; i >= 0; i--) {
10
      while (pq.size() && pq.top().second > i + k) pq.pop();
11

12
      score[i] = nums[i];
13
      score[i] += (pq.size() ? pq.top().first : 0);
14
      pq.push({score[i], i});
15
    }
16

17
    return score[0];
18
  }
19
};