9度OnlineJudge之1034：寻找大富翁

九度OnlineJudge之1034：寻找大富翁

题目描述： #include <iostream>#include <queue>using namespace std;const int MAX = 100000+10;int val[MAX];int main(){int n,m;while(cin>>n>>m,n!=0&&m!=0){priority_queue<int> pq;bool flag = false;for (int i=1;i<=n;++i){int tmp; cin>>tmp;pq.push(tmp);}while(m--&&n--){if (flag)cout<<" ";elseflag = true;cout<<pq.top();pq.pop();}cout<<endl;}return 0;}