1
class Solution {
2
 public:
3
  int timeRequiredToBuy(vector<int> &tickets, int k) {
4
    int ans = 0;
5
    int n = tickets.size();
6
    int ele = tickets[k];
7
    for (int i = 0; i < n; i++) {
8
      if (i <= k) {
9
        ans += min(ele, tickets[i]);
10
      } else {
11
        ans += min(ele - 1, tickets[i]);
12
      }
13
    }
14
    return ans;
15
  }
16
};