//牛客网代码:https://www.nowcoder.com/questionTerminal/6a296eb82cf844ca8539b57c23e6e9bf
//make_heap讲解:https://blog.csdn.net/liu_sheng_1991/article/details/52298887
#include<iostream>
#include<vector>
//#include<functional>
#include<algorithm>
using namespace std;
int main()
{
int num;
vector<int> nums;
int k;
cin >> k;
while (cin >> num)
nums.push_back(num);
if (nums.size() < 0 || k<0 || k>nums.size())
return false;
vector<int> res(nums.begin(),nums.begin()+k);
make_heap(res.begin(), res.end()); //默认是最大堆
for (int i = k; i < nums.size(); i++)
{
if (nums[i] < res[0])
{
pop_heap(res.begin(),res.end());
res.pop_back();
res.push_back(nums[i]);
push_heap(res.begin(),res.end());
}
}
sort_heap(res.begin(),res.end());
for (int i = 0; i < res.size(); i++)
cout << res[i] << " ";
system("pause");
}
//3 2 6 8 1 2 9 45 2 3 9