Printer Queue

Medium Queue: Applications PRO

🔒 Login to Unlock

Problem Statement

Write a C program to simulate a printer queue processing jobs in FIFO order and print the order of processed job IDs.

Input Format

First line contains n. Second line contains n job IDs.

Output Format

Print processed job IDs in order separated by spaces.

Constraints

1 <= n <= 50

Sample Input

4
101 102 103 104

Sample Output

101 102 103 104

Explanation

Enqueue all job IDs into a queue and dequeue them one by one to simulate print job execution.

Starter Code

#include <stdio.h>
#include <stdlib.h>

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here to simulate printer queue
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock