// 順序優(yōu)先級隊(duì)列的應(yīng)用SPQueuem.cpp
#include<iostream.h>
#include<iomanip.h>
#include<stdio.h>
#include<stdlib.h>
#include "SPQueue.cpp"
void main()
{cout<<"SPQueuem.cpp運(yùn)行結(jié)果:\n";
 SqPqueue MyQueue;
 datatype task;
 int i,m;
 cout<<"輸入產(chǎn)生隨機(jī)數(shù)的種子數(shù)m:";cin>>m;
 srand(m);
 cout<<"生成順序優(yōu)先級隊(duì)列MyQueue:\n";
 for(i=0;i<MaxSize;i++)
 {task.taskNo=i+1;
  task.priority=rand()%10;
  MyQueue.InsertPQ(task);}
 cout<<"求順序優(yōu)先級隊(duì)列MyQueue的長度:";
 cout<<MyQueue.PQueueSize()<<endl;
 cout<<"輸出順序優(yōu)先級隊(duì)列MyQueue:\n";
 cout<<"序號 任務(wù)號 優(yōu)先級\n";
 i=1;
 while(!MyQueue.PQueueEmpty())
  {cout<<setw(2)<<i;
   task=MyQueue.DeQueue();
   cout<<setw(6)<<task.taskNo;
   cout<<setw(7)<<task.priority<<endl;
   i++;}
 cin.get();cin.get();}