Position: SDE 1 Backend\nYoE: 1 year 3 months\n\n\n**Minimum Price**\n\nThere are `N` stones lying in a line. The cost and type of the ith stone is `ai` unit(s) and `i` respectively. You are initially having zero stones and you wish to collect all `N` types of stones, `type 1, type 2,...type N`.\nYou can perform the following operations multiple times (probably zero) to change the types of all the stones in one step:\n* The stone of the type i will be changed to the type `i + 1`. If `i` is `N`, then change its type to 1.`(1 <= i <= N)`\n\nApplying this operation single time costs `x` unit(s).\nYour task is to print the minimum price that you have to pay to get all the `N` types of stones in your collection.\n\n**Input format :**\n* First line: Two integers `N, x`.\n* Next line: `N` space seperated integers representing the price of each stone.\n\n**Output format :**\n* Print a single integer representing the minimum price to get all the `N` types of stones.\n\n**Input Constraints :**\n`1 < N <= 2000`\n`0 < x < 10^9`\n`1 <= a[i] <= 10^9`\n\n**Sample Input :**\n```\n3 5\n50 1 50\n```\n**Sample Output :**\n```\n13\n```\n\n

Position: SDE 1 Backend\nYoE: 1 year 3 months\n\n\nMinimum Price\n\nThere are N stones lying in a line. The cost and type of the ith stone is ai unit(s) and i r

Sharechat | OA | HackerEarth | SDE-1 | Minimum Price