Minimizing Sum :
Difficulty Level : Easy
Submissions : 382
Asked In :
Marks :10
: 1 | : 0
Given an array $$$a$$$ consisting of $$$n$$$ non-negative integers, the following operation can be carried out any number of times:
- Choose an index $$$i$$$ $$$(1 \leq i \leq n)$$$, and change $$$a_i$$$ to any non-negative integer $$$x$$$.
Input
The first line of input consists of an integer $$$n$$$ $$$-$$$ the total number of elements in the array. The second line consists of $$$n$$$ space separated integers - the elements of the array.
Output
Output a single integer - the minimum possible sum of the elements of the array after carrying out all operations.
Example
Input
3 2 2 4
Output
9
