Day1—B
There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.
For example, we have the following queue with the quantum of 100ms.
A(150) - B(80) - C(200) - D(200)
First, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).
B(80) - C(200) - D(200) - A(50)
Next, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.
C(200) - D(200) - A(50)
Your task is to write a program which simulates the round-robin scheduling.
Input
n q
name1 time1
name2 time2
...
namen timen
In the first line the number of processes n and the quantum q are given separated by a single space.
In the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.
Output
For each process, prints its name and the time the process finished in order.
Constraints
- 1 ≤ n ≤ 100000
- 1 ≤ q ≤ 1000
- 1 ≤ timei ≤ 50000
- 1 ≤ length of namei ≤ 10
- 1 ≤ Sum of timei ≤ 1000000
Sample Input 1
5 100 p1 150 p2 80 p3 200 p4 350 p5 20
Sample Output 1
p2 180 p5 400 p1 450 p3 550 p4 800
Notes
题意:给你一组工作,以及各个工作需要的时间,以及一个单位时间。这些工作需要排队完成,如果一个单位时间内该工作无法完成,那么该工作就需要重新排队到最后,它需要的时间将减去一个单位时间,如果能完成,那么输出它完成时的总耗时(从第一个工作开始的瞬间到现在)。
思路:用队列模拟即可,需要注意的是队列不能遍历只能输出一个删一个(应该吧,反正我不会遍历)
代码如下:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
typedef long long ll;
using namespace std;
struct names{
string name;
int time;
}q[100005];
int main(void)
{
ll times=0;
queue<names>que;
queue<names>ques;
std::ios::sync_with_stdio(false);
int n,t;
cin>>n>>t;
for(int i=0;i<n;i++)
{
cin>>q[i].name>>q[i].time;
que.push(q[i]);
}
/*for(std::<names>::iterator it=que.begin();it!=que.end();it++)
{
cout<<*it.time<<endl;
}*///这种方法遍历不行
while(!que.empty())
{
if(que.front().time>t)
{
que.front().time-=t;
que.push(que.front());
que.pop();
times+=t;
}
else
{
times+=que.front().time;
que.front().time=times;
ques.push(que.front());
que.pop();
}
}
while(!ques.empty())
{
cout<<ques.front().name<<" "<<ques.front().time<<endl;
ques.pop();
}
}