Queue

Queue

题目：
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

代码如下：

#include<bits/stdc++.h>
using namespace std;
#define MAX 100005
struct Node
{
    char name[100];
    int t;
};
Node p[MAX];

int main()
{
    int n,k,rest,sum = 0;
    queue<Node> q;
    scanf("%d%d",&n,&k);
    for(int i = 0;i < n;i++)
    {
        scanf("%s%d",&p[i].name,&p[i].t);
        q.push(p[i]);
    }
    while(!q.empty())
    {
        Node s = q.front();
        q.pop();
        sum += min(s.t,k);
        rest = s.t - k;
        if(rest <= 0) cout << s.name << " " << sum << endl;
        else
        {
            s.t = rest;
            q.push(s);
        }
    }
    return 0;
}

这是一道简单队列题，由题意可知时间片的长度是固定的，每个任务处理的时间各不相同，首先将每个任务都入队（此处使用结构体）。然后从第一个任务开始判断，如果一个任务的时间小于时间片的长度，那么打印之后出队即可，如果一个任务的时间大于时间片的长度，那么将这个任务的时间减去时间片再次入队即可，直到队列为空。

这里每次处理的时间需要累加，因为在打印中会用到。