#include <iostream>
#include <queue>
#include <vector>
#include <memory.h>
using namespace std;
typedef struct
{
    int time;
    int period;
    int id;
} Reg;
struct cmp
{
    bool operator()( Reg a, Reg b)
    {
        if(a.time == b.time)
          return a.id>b.id;
        else
          return a.time>b.time;
    }
};
int main()
{
    char temp[10];
    int id,period;
    priority_queue<Reg,vector<Reg>,cmp> q;
    while(cin>>temp)
      if(temp[0]=='#')
      break;
      else
      {
          Reg r;
          cin>>id>>period;
          r.id = id;
          r.period = period;
          r.time = period;
          q.push(r);
      }
      int k;
      cin>>k;
      while(k--)
      {
          Reg r = q.top();
          cout<<r.id<<endl;
          r.time += r.period;
          q.pop();
          q.push(r);
      }
    return 0;
}

• 只是想练习最小堆……（貌似优先队列和堆都是32ms） (1962) YanXB 2015-01-25 11:37:29