For this Question: There are n people in a line queuing to buy tickets, where the 0th person is at the front of the line and the (n - 1)th person is at the back of the line.

You are given a 0-indexed integer array tickets of length n where the number of tickets that the ith person would like to buy is tickets[i].

Each person takes exactly 1 second to buy a ticket. A person can only buy 1 ticket at a time and has to go back to the end of the line (which happens instantaneously) in order to buy more tickets. If a person does not have any tickets left to buy, the person will leave the line.First line: n and k, denoting the total number of people and k.
Second line: n integers in which the ith integer denote the number of tickets ith person wants to buy.

<b>Constraints</b>
1 &le; n &le; 100
1 &le; tickets[i] &le; 100
0 &le; k < n


Print the time taken for the person at position k (0-indexed) to finish buying tickets.

Input:
3 2
2 3 2
Output: 
6
Explanation: 
- In the first pass, everyone in the line buys a ticket and the line becomes [1, 2, 1].
- In the second pass, everyone in the line buys a ticket and the line becomes [0, 1, 0].
The person at position 2 has successfully bought 2 tickets and it took 3 + 3 = 6 seconds., I have written this Solution Code: import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int k=sc.nextInt();
        sc.nextLine();
        int tickets[]=new int[n];
        for(int i=0;i<n;i++){
            tickets[i]=sc.nextInt();
        }
        Queue<int[]> queue = new LinkedList<>(); // Queue of people, each represented as an int array [position, ticketsRemaining]
        // Initialize queue with people and their remaining tickets
        for (int i = 0; i < n; i++) {
            queue.offer(new int[]{i, tickets[i]});
        }
        
        int time = 0;
        while (!queue.isEmpty()) {
            int[] person = queue.poll();
            int position = person[0];
            int ticketsRemaining = person[1];
            
            // Buy one ticket
            ticketsRemaining--;
            time++;
            
            if (ticketsRemaining > 0) {
                // Person still has tickets left, enqueue them at the end of the queue
                queue.offer(new int[]{position, ticketsRemaining});
            } else if (position == k) {
                // Person at position k has finished buying tickets, return the total time elapsed
                break;
            }
        }
        System.out.print(time);
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?