poj 1281 MANAGER

//这题属于简单的模拟题，主要是用两个容器来储存增加进来的cost和删除的cost即可！然后再根据给出的删除清单，在储存删除的容器中进行！
//就开始的时候WA了一次，是因为输出格式的问题，值得注意！ 
#include "iostream"
#include "string"
#include "set"
#include "vector"
using namespace std;

multiset<int> s;//增加cost的储存 
vector<int> v;//删除cost的储存 
multiset<int>::iterator it;
int policy;

void a()//增加 
{
     int cost;
     cin >> cost;
     s.insert(cost);
}

void re(int pp)//删除 
{
     if (pp == 1)
     {
         if (s.empty())
            cout << "-1" << endl;
         else
         {
             it = s.begin();
             v.push_back((*it));
             s.erase(it);
         }
     }
     else if (pp == 2)
     {
          if (s.empty())
            cout << "-1" << endl;
         else
         {
             int size = s.size();
             for (it = s.begin(); it != s.end(); it++)
             {
                 size--;
                 if (size == 0)
                 {
                   break;
                 }
             }
             v.push_back((*it));
             s.erase(it);
         }
     }
}

void p()//policy的类型 
{
     int p;
     cin >> p;
     policy = p;
}

int main()
{
    int maxcost, len, i, count;
    char request;
    bool flag;
    while (cin >> maxcost >> len)
    {
          int *r = new int[len];
          for (i = 0; i < len; i++)
              cin >> r[i];
          flag = false;
          s.clear();
          v.clear();
          count = 0;
          policy = 1;
          while (1)
          {
                cin >> request;
                if (request == 'a')
                {
                    a();
                }
                else if (request == 'r')
                {
                    re(policy);
                }
                else if (request == 'p')
                {
                     p();
                }
                else if (request == 'e')
                {
                    flag = true;
                    break;
                }
          }
          for (i = 0; i < len; i++)
              cout << v[r[i]-1] << endl;
          cout << endl;
          if (flag)  continue;
    }
    system("pause");
}

/*
5
2
1 3
a 2
a 3
r
a 4
p 2
r
a 5
r
e

1
1
2
p 2
a 1
a 1
a 1
p 1
r
a 1
r
e

100
5
1 2 3 4 5
a 14
r
p 2
a 15
a 13
r
p 1
p 2
p 1
a 90
a 30
a 52
r
p 2
r
p 1
r
e

10
3
1 3 5
a 2
a 1
r
p 2
a 4
r
a 3
p 1
a 8
r
a 2
a 1
p 2
r
a 4
p 1
a 3
r
a 9
a 8
a 7
r
e

160
6
1 2 3 31 42 53
a 1
a 2
a 3
a 4
a 5
a 6
a 7
a 8
a 9
a 10
a 11
a 12
a 13
a 14
a 15
a 16
a 17
a 18
a 19
a 20
a 160
a 159
a 158
a 157
a 156
a 155
a 154
a 153
a 152
a 151
a 150
a 21
a 149
a 22
a 148
a 43
a 147
a 44
a 146
a 145
a 144
a 45
a 143
a 46
a 47
a 48
a 49
a 50
a 142
a 141
a 140
a 139
a 138
a 137
a 136
a 135
a 134
a 133
a 132
a 131
r
r
r
r
r
p 2
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
p 1
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
e
*/


/*
1

14
15
13
90
30

1
2
1

1
2
3
7
18
49
*/