poj 1281 MANAGER

题意：进程管理，这里提供几种操作

 

• a x - add to the queue the process with the cost x; 
• r - remove a process, if possible, from the queue according to the current manager policy; 
• p i - enforce the policy i of the manager, where i is 1 or 2. The default manager policy is 1 
• e - ends the list of requests. 

 

思路：用一维数组模拟该过程即可，没什么难度，在进行r操作时，可根据p i 的值进行排序

具体见代码：

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int remov[1001],r[1001];int cost[2000];int cmp_des(int a, int b){return a > b;}int cmp_asc(int a, int b){return a < b;}int main(void){int MAX;while(scanf("%d",&MAX) != EOF){int i,count=1,p=1,top=0;int len,c;scanf("%d",&len);for(i=0; i<len; ++i)scanf("%d",&r[i]);char op;while(scanf("%c",&op)){if(op == 'e')break;else if(op == 'a'){scanf("%d",&c);cost[top++] = c;}else if(op == 'p'){scanf("%d",&p);}else if(op == 'r'){if(p == 1){sort(cost,cost+top,cmp_des);remov[count++] = cost[--top];}else if(p == 2){sort(cost,cost+top,cmp_asc);remov[count++] = cost[--top];}}}for(i=0; i<len; ++i)printf("%d/n",remov[r[i]]);printf("/n");}return 0;}