C语言实现任务时间队列

题目

直接上代码洛

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
# define LEN 10000

typedef struct pp{
    char name[100];
    int t;
    }p;
p Q[LEN];//结构体数组
int head,tail,n;
void enqueue(p x){
    Q[tail] = x;
    tail = (tail+1)%LEN;
    }
p dequeue(){
    p x = Q[head];
    head = (head+1) % LEN;
    return x;
    }
int min(int a,int b){return a<b?a:b;}//返回最小值
int main()
{
    int elaps = 0,c;
    int i,q;
    p u;
    scanf("%d %d",&n,&q);//多少个和时间碎片
    //添加任务到循环队列
    for(i = 1;i<=n;i++){
        scanf("%s",Q[i].name);//字符数组不用加取地址运算符
        scanf("%d",&Q[i].t);
    }
    //直接初始化队列指针
    head = 1;
    tail = n+1;
    while(head!=tail){
        u = dequeue();
        c = min(q,u.t);
        u.t -= c;
        elaps += c;
        if(u.t>0)
            enqueue(u);
        else{
            printf("%s %d",u.name,elaps);
            printf("\n");
        }
    }


    return 0;
}