Queue Container Adapter

Easy STL Containers

Solve in Playground →

Problem Statement

Write a C++ program using `std::queue` to process elements using FIFO (First-In, First-Out) behavior.

Input Format

First line: N. Second line: N space-separated integers.

Output Format

Print elements dequeued separated by a space.

Constraints

1 <= N <= 1000

Sample Input

5
1 2 3 4 5

Sample Output

1 2 3 4 5

Explanation

Queues operate on FIFO principles, preserving input order.

Starter Code

#include <iostream>
#include <queue>

int main() {
    int n;
    if (std::cin >> n) {
        std::queue<int> q;
        for (int i = 0; i < n; i++) {
            int val;
            std::cin >> val;
            q.push(val);
        }
        // Write your queue dequeue logic here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →