题目：Argus
思路：模拟，把每一次的情况存入优先队列。
代码：
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <map>
using namespace std;struct A {int x,y;A() {}A(int xx,int yy) {x=xx,y=yy;}bool operator <(const A& other) const {if(y>other.y||(y==other.y&&x>other.x)) return true;return false;}
};int k,n=0;
A a[1005];priority_queue<A> que;int main() {string t;while(cin>>t&&t[0]!='#') {int x,y;scanf("%d%d",&x,&y);a[++n]=A(x,y);}scanf("%d",&k);for(int i=1; i<=n; i++)for(int j=1; j<=k; j++) {que.push(A(a[i].x,a[i].y*j));}for(int i=1;i<=k;i++){printf("%d\n",que.top().x);que.pop(); }return 0;
}