queue vector greater <int> 从小到大排列



#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main()
{
    priority_queue<int,vector<int> ,greater<int> >p;
    int tmp;
    for(int i=0;i<5;i++){
        cin>>tmp;
        p.push(tmp);
    }
    while(!p.empty()){
        cout<<p.top()<<endl;
        p.pop();
    }
}