优先队列

来源：互联网发布：吾生吾生有涯而知无涯编辑：程序博客网时间：2024/06/06 02:41

点击打开链接

#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <queue>#include <functional>using namespace std;#define mod 1000000007struct node{    int x;//两种写法都行    /*bool friend operator<(node a,node b)    {        return a.x%3<b.x%3||a.x%3==b.x%3&&a.x<b.x;    }*/    bool operator<(const node &b)const    {        return x%3<b.x%3||x%3==b.x%3&&x<b.x;    }};int main(){    int n,m;    int num[10000];    long long ans,sum;    node t;    while(~scanf("%d %d",&n,&m))    {        priority_queue<node>q;        sum=0;        for(int i=0; i<n; i++)        {            scanf("%d",&t.x);            q.push(t);            sum+=t.x/3+(t.x%3==0?0:1);        }        ans=sum;        while(m--)        {            if(!q.empty())            {                t=q.top();                q.pop();                sum-=t.x/3+(t.x%3==0?0:1);                t.x-=2;                if(t.x>0)                {                    sum+=t.x/3+(t.x%3==0?0:1);                    q.push(t);                }                ans=(ans+sum)%mod;            }        }        printf("%lld\n",ans);    }    return 0;}

/*优先队列的基本使用    2010/7/24    dooder*/  #include<stdio.h>  #include<functional>  #include<queue>  #include<vector>  using namespace std;  //定义结构，使用运算符重载,自定义优先级1  struct cmp1{      bool operator ()(int &a,int &b){          return a>b;//最小值优先      }  };  struct cmp2{      bool operator ()(int &a,int &b){          return a<b;//最大值优先      }  };  //定义结构，使用运算符重载,自定义优先级2  struct number1{      int x;      bool operator < (const number1 &a) const {          return x>a.x;//最小值优先      }  };  struct number2{      int x;      bool operator < (const number2 &a) const {          return x<a.x;//最大值优先      }  };  int a[]={14,10,56,7,83,22,36,91,3,47,72,0};  number1 num1[]={14,10,56,7,83,22,36,91,3,47,72,0};  number2 num2[]={14,10,56,7,83,22,36,91,3,47,72,0};    int main()  {   priority_queue<int>que;//采用默认优先级构造队列        priority_queue<int,vector<int>,cmp1>que1;//最小值优先      priority_queue<int,vector<int>,cmp2>que2;//最大值优先        priority_queue<int,vector<int>,greater<int> >que3;//注意“>>”会被认为错误，                                                        //这是右移运算符，所以这里用空格号隔开      priority_queue<int,vector<int>,less<int> >que4;////最大值优先        priority_queue<number1>que5;      priority_queue<number2>que6;        int i;      for(i=0;a[i];i++){          que.push(a[i]);          que1.push(a[i]);          que2.push(a[i]);          que3.push(a[i]);          que4.push(a[i]);      }      for(i=0;num1[i].x;i++)          que5.push(num1[i]);      for(i=0;num2[i].x;i++)          que6.push(num2[i]);          printf("采用默认优先关系:\n(priority_queue<int>que;)\n");      printf("Queue 0:\n");      while(!que.empty()){          printf("%3d",que.top());          que.pop();      }      puts("");      puts("");        printf("采用结构体自定义优先级方式一:\n(priority_queue<int,vector<int>,cmp>que;)\n");      printf("Queue 1:\n");      while(!que1.empty()){          printf("%3d",que1.top());          que1.pop();      }      puts("");      printf("Queue 2:\n");      while(!que2.empty()){          printf("%3d",que2.top());          que2.pop();      }      puts("");      puts("");      printf("采用头文件\"functional\"内定义优先级:\n(priority_queue<int,vector<int>,greater<int>/less<int> >que;)\n");      printf("Queue 3:\n");      while(!que3.empty()){          printf("%3d",que3.top());          que3.pop();      }      puts("");      printf("Queue 4:\n");      while(!que4.empty()){          printf("%3d",que4.top());          que4.pop();      }      puts("");      puts("");      printf("采用结构体自定义优先级方式二:\n(priority_queue<number>que)\n");      printf("Queue 5:\n");      while(!que5.empty()){          printf("%3d",que5.top());          que5.pop();      }      puts("");      printf("Queue 6:\n");      while(!que6.empty()){          printf("%3d",que6.top());          que6.pop();      }      puts("");      return 0;  }  /* 运行结果 ： 采用默认优先关系: (priority_queue<int>que;) Queue 0:  91 83 72 56 47 36 22 14 10  7  3  采用结构体自定义优先级方式一: (priority_queue<int,vector<int>,cmp>que;) Queue 1:   3  7 10 14 22 36 47 56 72 83 91 Queue 2:  91 83 72 56 47 36 22 14 10  7  3  采用头文件"functional"内定义优先级: (priority_queue<int,vector<int>,greater<int>/less<int> >que;) Queue 3:   3  7 10 14 22 36 47 56 72 83 91 Queue 4:  91 83 72 56 47 36 22 14 10  7  3  采用结构体自定义优先级方式二: (priority_queue<number>que) Queue 5:   3  7 10 14 22 36 47 56 72 83 91 Queue 6:  91 83 72 56 47 36 22 14 10  7  3 */

0 0