//file:queue.h
#ifndef _Queue_H_INCLUDE_
#define _Queue_H_INCLUDE_
#define N 10002
#include
template
class Queue
{
public:
Queue():frount(1),rear(1) {}
void push(T t);
void pop();
T front();
bool empty();
private:
int frount,rear;
T Q[N];
};
template
bool Queue::empty()
{
if(frount==rear) return true;
else return false;
}
template
T Queue::front()
{
if (!empty()) return Q[frount];
else {printf("Empty!\n");}
}
template
void Queue::pop()
{
if(!empty()) frount++;
else printf("Empty!\n");
}
template
void Queue::push(T t)
{
Q[rear]=t;
rear++;
}
#endif // _STACK_H_INCLUDE_
// è°é
#include
#include "queue.h"
using namespace std;
struct node
{
char name[20];
char sex;
};
int main()
{
Queue m,w;
int n;
struct node x;
cin >> n;
while(n--)
{
cin >> x.name;
cin >> x.sex;
if(x.sex=='w') w.push(x);
else if(x.sex=='m') m.push(x);
else ;
}
while(!w.empty()&&!m.empty())
{
cout << w.front().name << "--" << m.front().name << endl;
w.pop();
m.pop();
}
if(w.empty())
{
printf("There are men still waiting!\n");
}
else if(m.empty())
{
printf("There are women still waiting!\n");
}
else printf("There is no person waiting!\n");
return 0;
}