Practice Challenge

Hard Queue: Applications PRO

🔒 Login to Unlock

Problem Statement

Write a C program to implement a Priority Queue using an array where elements are kept sorted on insertion.

Input Format

First line contains n operations. Subsequent lines contain elements to insert into the priority queue.

Output Format

Print the final elements of the priority queue in order of priority (ascending) separated by spaces.

Constraints

1 <= n <= 50

Sample Input

5
40 10 50 30 20

Sample Output

10 20 30 40 50

Explanation

Insert elements into the priority queue maintaining sorted order so that higher priority elements can be dequeued easily.

Starter Code

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

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

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock