class Solution {
public:
vector<int> maxInWindows(const vector<int>& num, unsigned int size) {
if(num.size() < size || size == 0){
return {};
}
priority_queue<pair<int, int>> q;
for (int i = 0; i < size; i++) {
q.push(pair<int, int>(num[i], i));
}
vector<int> ans = {q.top().first};
for (int i = size; i < num.size(); i++) {
q.push(pair<int, int>(num[i], i));
while (q.top().second <= i - size) {
q.pop();
}
ans.push_back(q.top().first);
}
return ans;
}
};