Oprea

Minimize_Sum_Of_Array

---

/*Our task is to find the minimum sum which is obtained from summing each Two integers product .
Input :: Output Examples ::

minSum({5,4,2,3}) // return 22
Explanation ::
5*2 +3*4 = 22

minSum({12,6,10,26,3,24}) // return 342
Explanation ::
26*3 + 24*6 + 12*10 = 342

minSum({9,2,8,7,5,4,0,6}) // return 74
Explanation ::
9*0 + 8*2 +7*4 +6*5 = 74
*/

#include <vector>
#include <algorithm>
using namespace std;

int minSum (vector<int>passed)
{
sort(passed.begin(), passed.end());
int sum=0, mal =1, i=0;
for( int j = passed.size()-1; j>i;i++, j-- )
{
mal = passed[i] * passed[j];
sum+=mal;
}
return sum;
}