Task Manager with Priority Queues

Medium Applied OOP Mini Projects
Solve in Playground →

Problem Statement

Implement a `TaskManager` OOP wrapper around priority processing. Read N tasks as ‘priority desc’, process highest priority first, and print description order. If priorities are equal, preserve the order of insertion.

Input Format

Line 1: N. Next N lines: priority (int) and description string.

Output Format

Print descriptions ordered by priority descending, then order of arrival, separated by line breaks.

Constraints

1 <= N <= 30

Sample Input

3
1 LowTask
3 HighTask
2 MidTask

Sample Output

HighTask
MidTask
LowTask

Explanation

High priority (3) runs first, then mid (2), then low (1).

Starter Code

class TaskManager:
    pass

if __name__ == '__main__':
    # Implement I/O logic here
    pass

Limits

  • Time Limit: 1s
  • Memory Limit: 256MB

Embedded C Programming

Updated: March 15, 2026
Intermediate

Embedded systems rely on efficient low-level programming to interact directly with hardware. In this course, you will learn how to write practical Embedded C programs used in real microcontroller-based systems. Rather than focusing only on theory, this course follows a practice-driven approach. Each lesson includes hands-on coding exercises that simulate real firmware development tasks used