题目1431：Sort

来源：互联网发布：路由访客网络什么意思编辑：程序博客网时间：2024/05/27 21:46

#include <iostream>#include <stdio.h>#include <algorithm>#include <math.h>#include <string>#include <string.h>#include <vector>#include <queue>#include <stack>#include <sstream>#include <climits>using namespace std;//1431int n,m;priority_queue<int> p;int main(){    //freopen("input.txt","r",stdin);    while(scanf("%d%d",&n,&m)!=EOF){        while(!p.empty()) p.pop();        while(n--){            int t;scanf("%d",&t);            p.push(t);        }        while(m--){            if(m==0){                printf("%d",p.top());                p.pop();            }            else{                printf("%d ",p.top());                p.pop();            }        }        printf("\n");    }    return 0;}/**************************************************************    Problem: 1431    User: cust123    Language: C++    Result: Accepted    Time:250 ms    Memory:7672 kb****************************************************************/

0 0