nyoj-754--黑心医生

来源：互联网发布：腾空的日子知乎编辑：程序博客网时间：2024/04/28 05:29

题目链接：http://acm.nyist.net/JudgeOnline/problem.php?pid=754

#include<stdio.h>#include<queue>using namespace std;int main(){    int n,m,a;    queue<int> q;    priority_queue<int> Q;    while(scanf("%d%d",&n,&m)!=EOF)    {        while(!Q.empty()) Q.pop();        while(!q.empty()) q.pop();        for(int i=0;i<n;i++)        {            scanf("%d",&a);            q.push(a);Q.push(a);        }        while(1)        {            int temp=q.front();            q.pop();            if(m==0)            {                if(temp!=Q.top())                {                    q.push(temp);                    m=Q.size()-1;                }                else break;            }            else            {                m--;                if(temp==Q.top())                {                    Q.pop();                }                else q.push(temp);            }        }        printf("%d\n",n-q.size());    }}