Update Buy the Ticket

Author: akshayavb99

Course 2 - Data Structures in JAVA/Lecture 21 - Priority Queues II/Buy the Ticket

@@ -41,3 +41,40 @@ Sample Output 2 :
 4
 */
 
+import java.util.*;
+public class Solution {
+	
+	public static int buyTicket(int input[], int k) {
+		/* Your class should be named Solution
+		* Don't write main().
+		* Don't read input, it is passed as function argument.
+		* Return output and don't print it.
+		* Taking input and printing output is handled automatically.
+		*/
+        Queue<Integer> queue = new LinkedList<>();
+        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());
+        for (int i=0;i<input.length;i++){
+            queue.add(i);
+            pq.add(input[i]);
+        }
+        int time=0;
+        while (!queue.isEmpty()){
+            if (input[queue.peek()] < pq.peek())
+            {
+                queue.add(queue.poll());
+            }
+            else
+            {
+                int idx = queue.poll();
+                pq.remove();
+                time++;
+                if (idx == k)
+                {
+                    break;
+                }
+            }
+        }
+        return time;
+
+	}
+}