Maximum Sum After Operations

You are given an array of integers $A$ of length $n$, and an integer $k$ which represents the number of allowed operations. In one operation, you can update any element of the array to any value. Under the assumption that if $k > 0$, you can transform the entire array so that each element becomes the maximum element present in the original array, compute the maximum possible sum of the array after performing at most $k$ operations. Note that if $k = 0$, no changes can be made and the sum of the array is simply $\sum_{i=1}^{n} A_i$, whereas if $k > 0$, the optimal sum is $n \times \max(A)$.

For example, if the array is [1, 2, 3, 4] and $k=2$, the maximum sum obtainable is $4 \times 4 = 16$.

inputFormat

The input is given in two lines. The first line contains two integers $n$ and $k$, where $n$ is the number of elements in the array and $k$ is the number of operations allowed. The second line contains $n$ space-separated integers representing the elements of the array.

outputFormat

Output a single integer representing the maximum possible sum of the array after performing at most $k$ operations. If $k = 0$, output $\sum_{i=1}^{n} A_i$, and if $k > 0$, output $n \times \max(A)$.## sample

4 2
1 2 3 4

16