解题思路:
(1)优先队列
#include<iostream>
#include<queue>
using namespace std;
int main() {
int n,k;
while(cin>>n) {
cin>>k;
priority_queue<int,vector<int>,greater<int>> pq;
int a;
for(int i=0;i<n;i++) {
cin>>a;
pq.push(a);
}
while(k>0) {
cout<<pq.top()<<' ';
pq.pop();
k--;
}
cout<<endl;
}
return 0;
}