1
class Solution {
2
  public int timeRequiredToBuy(int[] tickets, int k) {
3
    int n = tickets.length;
4
    int time = 0;
5

6
    if (tickets[k] == 1) return k + 1;
7
    while (tickets[k] > 0) {
8
      for (int i = 0; i < n; i++) {
9
        if (tickets[i] == 0) continue;
10
        tickets[i] = tickets[i] - 1;
11
        time++;
12
        if (tickets[k] == 0) break;
13
      }
14
    }
15
    k--;
16
    return time;
17
  }
18
}