using c++ (structures) and without library please and try not to be limit exceed.

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 (1sn s105, 1 sk s104) - the quantity of clients and ticket windows respectively. The second line contains n natural numbers. Each ith number determines the time t; (1st;s 105) required to serve the ith client from the queue. Output: The minimal time needed to serve the queue. Example: Input Output 5 2 6 31 1 2 3 73 1 2 3 4 5 3 1