题目链接:https://vjudge.net/problem/UVA-1203
题意:给定若干行信息,每行包含字符串s,整数ID-number,整数period,代表s在ID-number时刻产生,自此每隔period产生一个s。求前n个信息分别是什么。
思路:求出每个s产生的n个信息分别对应哪个时刻,将所有的信息按时刻从早到晚排序,输出前n个
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<sstream>
#include<deque>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-9;
const int maxn = 1e7 + 20;
const int maxt = 300 + 10;
const int mod = 10;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int Dis[] = {-1, 1, -5, 5};
const double inf = 0x3f3f3f3f;
const int MOD = 1000;
const double PI = acos(-1.0);
int n, m, k;
int R;
struct node{
int id;
int times;
node(int id = 0, int times = 0) : id(id), times(times){}
bool operator < (const node &no) const{
if(times != no.times) return times < no.times;
return id < no.id;
}
}num[maxn];
int a[maxn], b[maxn];
char s[100];
int main(){
int cnt = 0;
while(~scanf("%s", s)){
if(s[0] == '#') break;
scanf("%d%d", &a[cnt], &b[cnt]);
++cnt;
}
int cur = 0;
int x;
scanf("%d", &x);
for(int i = 0; i < cnt; ++i){
for(int j = 1; j <= x; ++j){
num[cur++] = node(a[i], b[i] * j);
}
}
sort(num, num + cur);
for(int i = 0; i < x; ++i){
printf("%d\n", num[i].id);
}
return 0;
}
即可。这里也可以用优先队列,每产生一个加入优先队列中,最终从优先队列中输出前n个即可。挺简单的一道题,优先队列版本就不写了。
代码如下: