HDU 1702 ACboy needs your help again!（附加优先队列）

ACboy was kidnapped!!
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out").
and the following N lines, each line is "IN M" or "OUT", (M represent a integer).
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!

 

Input

The input contains multiple test cases.
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.

 

Output

For each command "OUT", you should output a integer depend on the word is "FIFO" or "FILO", or a word "None" if you don't have any integer.

 

Sample Input

4 4 FIFO IN 1 IN 2 OUT OUT 4 FILO IN 1 IN 2 OUT OUT 5 FIFO IN 1 IN 2 OUT OUT OUT 5 FILO IN 1 IN 2 OUT IN 3 OUT

 

Sample Output

1 2 2 1 1 2 None 2 3

 

队列和栈：
#include<stdio.h>
#include<string.h>
#include<queue>
#include<stack>
# define N 10
using namespace std;
int main ()
{
    int T, n, x, t;
    char s[N], str[N];
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d %s", &n, str);
        if (strcmp(str, "FIFO") == 0)
        {
            queue<int>q;
            while (n--)
            {
                scanf("%s", s);
                if (strcmp(s, "IN") == 0)
                {
                    scanf("%d", &x);
                    q.push(x);
                }
                else
                {
                    if (!q.empty())
                    {
                        t = q.front();
                        q.pop();
                        printf("%d
", t);
                    }
                    else
                        printf("None
");
                }
            }
        } //FIFO代表先进先出，运用队列做
        else
        {
            stack<int>q;
            while (n--)
            {
                scanf("%s", s);
                if (strcmp(s, "IN") == 0)
                {
                    scanf("%d", &x);
                    q.push(x);
                }
                else
                {
                    if (!q.empty())
                    {
                        t = q.top();
                        q.pop();
                        printf("%d
", t);
                    }
                    else
                        printf("None
");
                }
            }
        } //FILO代表先进后出，运用栈做
    }
    return 0;
}

队列：
#include<stdio.h>
#include<queue>
using namespace std;
int main ()
{
    int a[5] = {1, 2, 4, 5, 6}, i, x;
    queue<int>q;
    for (i = 0; i < 5; i++)
        q.push(a[i]);
    while (!q.empty())
    {
        x = q.front();
        q.pop();
        printf("%d ", x);
    }
    printf("
");
    return 0;
}

优先队列：
#include<stdio.h>
#include<queue>
using namespace std;
typedef struct node
{
    int x, step;
    friend bool operator < (node n1, node n2)
    {
        return n1.step > n2.step;
    }
}NODE;
int main ()
{
    NODE no[5] = { {1, 5}, {2, 2}, {3, 4}, {4, 3}, {1, 1} }, n;
    int i;
    priority_queue<NODE>q;
    for (i = 0; i < 5; i++)
        q.push(no[i]);
    while (!q.empty())
    {
        n = q.top();
        q.pop();
        printf("%d %d
", n.x, n.step);
    }
    return 0;
}

栈：
#include<stdio.h>
#include<stack>
using namespace std;
int main ()
{
    int a[5] = {1, 3, 4, 5, 6}, i, x;
    stack<int>q;
    for (i = 0; i < 5; i++)
        q.push(a[i]);
    while (!q.empty())
    {
        x = q.top();
        q.pop();
        printf("%d ", x);
    }
    printf("
");
    return 0;
}