fzu 1182 Argus 优先队列

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
struct node
{
    int num;
    int t;
    int now;
    friend bool operator < (node n1,node n2)
    {
        if(n1.now==n2.now) return n2.num<n1.num;
        return n2.now<n1.now;
    }

}tp;

priority_queue<node>q;

int main()
{
    int cnt,i,n,top,num,t,k,amt=0;
    char s[100];
    while(!q.empty()) q.pop();
    while(~scanf("%s",s))
    {
        if(strcmp(s,"#")==0)
        {
            cnt=0;
            scanf("%d",&k);
            while(cnt<k)
            {
                tp=q.top();
                q.pop();
                t=tp.now;
                printf("%d\n",tp.num);
                cnt++;
                tp.now+=tp.t;
                q.push(tp);
                while(t==q.top().now&&cnt<k)
                {
                    tp=q.top();
                    q.pop();
                    printf("%d\n",tp.num);
                    cnt++;
                    tp.now+=tp.t;
                    q.push(tp);
                }
            }
            while(!q.empty()) q.pop();
        }
        else
        {
            scanf("%d%d",&num,&t);
            tp.num=num;
            tp.t=t;
            tp.now=t;
            q.push(tp);
        }
    }
    return 0;
}

版权声明：本文为博主原创文章，未经博主允许不得转载。