杭电3785--寻找大富翁

 1 #include <queue>
 2 #include <cstdio>
 3 #include <iostream>
 4 using namespace std;
 5 int main()
 6 {
 7     int n, m, i, p;
 8     
 9     while(~scanf("%d %d", &n, &m), m+n)
10     {
11         
12         priority_queue<int, vector<int>, less<int> >q;
13         for(i=0; i<n; i++)
14         {
15             scanf("%d", &p);
16             q.push(p);
17         }
18         printf("%d",q.top());
19         q.pop();
20         int total = 1;
21         while(!q.empty())
22         {
23             if(total == m)
24             break;
25             printf(" %d",q.top());
26             q.pop();
27             total++;
28         }
29         printf("\n");
30         
31     }
32     return 0;
33 }