队列实现最简单的排队看病系统

#include<iostream>
#include<stdlib.h>
using namespace std;
typedef int ElemType;
const int MaxSize=1000;


struct Queue
{
ElemType queue[MaxSize];
int front,rear;

};


void InitQueue(Queue& Q)
{
Q.front=Q.rear=0;
}


void EnQueue(Queue& Q,ElemType item)
{
Q.rear=(Q.rear+1)%MaxSize;
Q.queue[Q.rear]=item;
}


ElemType OutQueue(Queue& Q)
{
if(Q.front==Q.rear)
{