题意:给出n个触发器,每个触发器每隔period时间就会生成一个Q_num,求前k个生成的Q_num
链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=18684
思路:每次找时间最短的Q_num,以时间排序,查找每次时间最少的Q_num,明显的优先队列问题,以时间为优先级进行调整,每次找到时间最短的,在加上period时间后重新插入队列中。进行n次循环。
注意点:无
以下为AC代码:
RunID
|
User
|
OJ
|
Prob ID
|
Result
|
Memory
(KB) |
Time
(ms) |
Language
|
Length
(Bytes) | |
---|---|---|---|---|---|---|---|---|---|
3111562 |
Accepted
| 19 | 1230 |
2014-12-24 22:00:43
|
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
struct node{
int t;
int num;
int per;
bool operator < ( const node &p ) const
{
return t > p.t || ( t == p.t && num > p.num );
}
};
int main()
{
ios::sync_with_stdio( false );
priority_queue<node> pq;
string str;
while ( cin >> str && str != "#" )
{
node tmp;
cin >> tmp.num >> tmp.per;
tmp.t = tmp.per;
pq.push ( tmp );
}
int k;
cin >> k;
for ( int i = 0; i < k; i ++ )
{
node tmp = pq.top();
pq.pop();
cout << tmp.num << endl;
tmp.t += tmp.per;
pq.push( tmp );
}
return 0;
}