优先队列 next_permutation

来源：互联网发布：mac os x10.9 iso下载编辑：程序博客网时间：2024/05/18 20:35

这是我写的2个测试程序

优先队列

#include<stdio.h>#include<queue>#include<algorithm>using namespace std;struct node{  int x,y;  friend bool operator<(const node a,const node b)  {      return a.x>b.x||(a.x==b.x&&a.y>b.y);   //>按从小到大排，<按从大到小排   }};node p[30];int main(){    int n;    while(scanf("%d",&n)==1)    {       int i;       priority_queue<node> q;       for(i=0;i<n;i++)       {         scanf("%d%d",&p[i].x,&p[i].y);         q.push(p[i]);       }       while(!q.empty())       {         node tmp=q.top();         q.pop();         printf("(%d,%d)\n",tmp.x,tmp.y);       }    }    return 0;}

next_permutation

#include<stdio.h>#include<algorithm>using namespace std;int main(){    int n,p[10];    while(scanf("%d",&n)==1)    {      for(int i=0;i<n;i++)      scanf("%d",&p[i]);      sort(p,p+n);      do      {         for(int i=0;i<n;i++)         printf("%d ",p[i]);         printf("\n");      }while(next_permutation(p,p+n));    }    return 0;}