Request Scheduler

Problem Statement

Request Scheduler Problem Description You are tasked with scheduling a set of requests based on their priority, estimated processing time, and available resources, within a maximum total processing time. Return: A vector/array of strings representing the request IDs in the order they would be processed. If a request cannot be processed within the time or resource constraints, it should be excluded. Empty Case: Return an array containing '*' if no requests can be processed within the constraints. Input Format The first line contains an integer N, representing the number of requests. The second line contains N space-separated strings representing the request IDs. The third line contains N space-separated integers representing the priority of each request (1-10, where 1 is highest priority). The fourth line contains N space-separated integers representing the estimated processing time of each request in minutes. The fifth line contains an integer T, representing the maximum total processi