100% Beast Code || Java Solution || 6 Lines Optimal Code
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int timeRequiredToBuy(int[] tickets, int k) {\n       int value =tickets[k];\n       int seconds=0;\n       for(int i=0;i<tickets.length;i++){\n        int max=(i<=k) ? value: value-1;\n        seconds+=(tickets[i]>max) ? max: tickets[i];\n       } \n       return seconds;\n    }\n}\n```
['Java']