leetcode

0 class Solution {

1 public:

2 int timeRequiredToBuy(vector<int> &tickets, int k) {

3 int time = 0;

4 for (int i = 0; i < tickets.size(); i++)

5 if (tickets[i] >= tickets[k])

6 time += tickets[k] - (i > k);

7 else

8 time += tickets[i];

9 return time;

10 }

11 };