使用优先级队列的k排序数组- C++

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

vector<int> kSortedArray(vector<int>& nums, int k) {
    priority_queue<int, vector<int>, greater<int>> pq;  // 优先级队列，默认为大顶堆，需要使用greater来构造小顶堆
    vector<int> result;

    // 先将前k个元素插入优先级队列
    for (int i = 0; i <= k && i < nums.size(); i++) {
        pq.push(nums[i]);
    }

    // 依次将后续元素插入队列，并弹出队列的最小元素
    for (int i = k + 1; i < nums.size(); i++) {
        result.push_back(pq.top());
        pq.pop();
        pq.push(nums[i]);
    }

    // 弹出剩余的元素
    while (!pq.empty()) {
        result.push_back(pq.top());
        pq.pop();
    }

    return result;
}

int main() {
    vector<int> nums = {5, 2, 9, 1, 7, 4, 6, 3, 8};
    int k = 3;
    vector<int> sortedNums = kSortedArray(nums, k);

    cout << "Sorted array: ";
    for (int num : sortedNums) {
        cout << num << " ";
    }
    cout << endl;

    return 0;
}