### Problem You are given an array A of length N. Processing the array from left to right: * If A[i] > 0, a group containing A[i] tickets is added to the end of a queue. * If A[i] = 0, the earliest u

Requires user login to view or download.

ME

You are given an array A of length N. Processing the array from left to right:

If A[i] > 0, a group containing A[i] tickets is added to the end of a queue.
If A[i] = 0, the earliest unprocessed group in the queue is removed, and its size is added to the score.
If the queue is empty, nothing happens.

Find the final score.

Input:[4,[50,23,0,14]]

Output:50

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Ticket Queue Score - Google OA IIIT Allahabad

EasyMed•1,042 views

You are given an array A of length N. Processing the array from left to right:

If A[i] > 0, a group containing A[i] tickets is added to the end of a queue.
If A[i] = 0, the earliest unprocessed group in the queue is removed, and its size is added to the score.
If the queue is empty, nothing happens.

Find the final score.