通过优先队列记录
class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
priority_queue<pair<int,int>>q;
q.emplace(nums[0],0);
for(int i=1;i<k-1;i++){
q.emplace(nums[i],i);
}
vector<int>out;
for(int i=k-1;i<nums.size();i++){
q.emplace(nums[i],i);
while(q.top().second<i-k+1){
q.pop();
}
out.emplace_back(q.top().first);
}
return out;
}
};