优先队列

优先队列

#include<iostream>
#include<cstdio>
#include<algorithm>
#include <cmath> 
#include <cstring>  
#include <string>
#include<sstream>
#include<set>
#include <cstdlib>
#include<map>
#include<queue>
#include<stack>
#include<vector>
using namespace std;
/*
**优先队列
*/
struct cmp1{
    bool operator()(int &a,int &b){
        return a>b;
    }
};
struct cmp2{
    bool operator()(int &a,int &b){
        return a<b;
    }
};
struct number1{
    int x;
    int v;
    bool operator<(const number1 &a) const{
        return x>a.x;
    }
};
struct number2{
    int x;
    int v;
    bool operator <(const number2 &a) const{
        return x<a.x;
    }
};
int arv[]={14,10,56,7,83,22,36,91,3,47,72,18,22,93,4,16,58,37,46,0};
int val[]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21};

int main()
{
    priority_queue <int>inQue;
    for(int i=0;arv[i];i++)
        inQue.push(arv[i]);

    priority_queue <int,vector<int>,cmp1> minQue;
    for(int i=0;arv[i];i++)
        minQue.push(arv[i]);

    priority_queue<int,vector<int>,cmp2> maxQue;
    for(int i=0;arv[i];i++)
        maxQue.push(arv[i]);

    priority_queue<number1> stcQue1;
    for(int i=0;arv[i];i++)
    {
        struct number1 num;
        num.x=arv[i],num.v=val[i];
        stcQue1.push(num);
    }

    priority_queue<number2> stcQue2;
    for(int i=0;arv[i];i++)
    {
        struct number2 num;
        num.x=arv[i],num.v=val[i];
        stcQue2.push(num);
    }
    //输出
    puts("Init:\n");
    while(!inQue.empty())
    {
        printf("%-3d",inQue.top());
        inQue.pop();
    }
    printf("\n\n");

        printf("Min:\n");
    while(!minQue.empty())
    {
        printf("%-3d",minQue.top());
        minQue.pop();
    }
    printf("\n\n");

    printf("Maxn:\n");
    while(!maxQue.empty())
    {
        printf("%-3d",maxQue.top());
        maxQue.pop();
    }
    printf("\n\n");

    printf("Struct min:\n");
    while(!stcQue1.empty())
    {
        printf("%-3d%-3d",stcQue1.top().v,stcQue1.top().x);
        stcQue1.pop();
    }
    printf("\n\n");

    printf("Struct max:\n");
    while(!stcQue2.empty())
    {
        printf("%-3d%-3d",stcQue2.top().v,stcQue2.top().x);
        stcQue2.pop();
    }
    printf("\n\n");
    return 0;
}