1
class Solution {
2
 public:
3
#define f first
4
#define s second
5
  vector<int> maxSlidingWindow(vector<int> &nums, int k) {
6
    vector<int> ans;
7
    priority_queue<pair<int, int>> pq;
8
    for (int i = 0; i < k; i++) pq.push({nums[i], i});
9

10
    ans.push_back(pq.top().f);
11

12
    for (int i = k; i < nums.size(); i++) {
13
      pq.push({nums[i], i});
14
      while (!pq.empty() && pq.top().s < i - k + 1) pq.pop();
15
      ans.push_back(pq.top().f);
16
    }
17
    return ans;
18
  }
19
};