最小的K个数

题目描述

输入n个整数，找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字，则最小的4个数字是1,2,3,4,。

 

class Solution {
public:
    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        vector<int> result;
        if(input.size() == 0 || k > input.size())
            return result;
        std::priority_queue<int,vector<int> ,greater<int> > pq;
        int len = input.size();
        for (int i = 0; i < len ; ++i)
        {
            pq.push(input[i]);
        }
        for (int i = 0 ;i < k ; ++i)
        {
            result.push_back(pq.top());
            pq.pop();
        }
        return result;
    }
};