Answered step by step
Verified Expert Solution
Question
1 Approved Answer
using Structures c++ and without using build-in function pls A queue Cost: 3 Solved: 0 Memory limit: 256 Mb Time limit: 1000 ms Input file:
using Structures c++ and without using build-in function pls
A queue Cost: 3 Solved: 0 Memory limit: 256 Mb Time limit: 1000 ms Input file: stdin Output file: stdout Task: Civil countries usually have k ticket windows on a railway station but there's only one waiting queue. The service works in such a way: initially, when all ticket windows are free, the first k people from the queue take their places at windows; all other people wait for their turn. As soon as a client gets served, the window calls for another client, the first one from the queue. This continues until all people are served. Find the minimal time needed to serve all clients. Input: The first line contains two integers n and K (1Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started