寻找大富翁
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9821 Accepted Submission(s): 3457
Problem Description
浙江桐乡乌镇共有n个人,请找出该镇上的前m个大富翁.
Input
输入包含多组测试用例.
每个用例首先包含2个整数n(0<n<=100000)和m(0<m<=10),其中: n为镇上的人数,m为需要找出的大富翁数, 接下来一行输入镇上n个人的财富值.
n和m同时为0时表示输入结束.
Output
请输出乌镇前m个大富翁的财产数,财产多的排前面,如果大富翁不足m个,则全部输出,每组输出占一行.
Sample Input
3 1
2 5 -1
5 3
1 2 3 4 5
0 0
Sample Output
5
5 4 3
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
using namespace std;
int main(void){
int n,m;
while( scanf("%d%d",&n,&m)!=EOF && n && m ){
priority_queue<int,vector<int>,greater<int> > q;
int t;
for( int i=1;i<=n;i++){
scanf("%d",&t);
if( i<= m ){
q.push( t );
}
else {
int tmp = q.top();
if( tmp < t ){
q.pop();
q.push( t );
}
}
}
stack<int>s;
while( !q.empty() ){
int tmp = q.top();
q.pop();
s.push( tmp );
}
while( !s.empty() ){
int tmp = s.top();
s.pop();
printf("%d",tmp);
if( s.size() == 0 )
printf("\n");
else printf(" ");
}
}
}