Customer Service Queue

Medium Queue: Applications PRO

🔒 Login to Unlock

Problem Statement

Write a C program to simulate a customer service ticketing queue, processing priority or regular customer tokens.

Input Format

First line contains n. Second line contains n customer tokens (positive numbers).

Output Format

Print served customer tokens in order separated by spaces.

Constraints

1 <= n <= 50

Sample Input

5
101 102 103 104 105

Sample Output

101 102 103 104 105

Explanation

Dequeue customer service tokens sequentially from the queue and print them as service is fulfilled.

Starter Code

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

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here for customer service queue simulation
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock