641. Array Partition
Given an array of 2n integers, the task is to group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of the minimum of each pair is maximized. Find the maximum sum.
The first line contains an integer N. The second line contains an integer array.
Print the maximized sum.
6 6 2 6 5 1 2
1 <= N <= 10^4 -10^4 <= Array[i] <= 10^4