class Solution {
public:
vector<int> getLeastNumbers(vector<int>& arr, int k)
{
vector<int>v;
if(k==0)return v;
//大顶堆
priority_queue<int, vector<int> , less<int> >q;
for(int i=0;i<arr.size();i++)
{
if(q.size()<k)
q.push(arr[i]);
else
{
if( arr[i]<q.top() )
{
q.push(arr[i]);
q.pop();
}
}
}
while(q.size())
{
v.push_back(q.top() );
q.pop();
}
return v;
}
};