LeetCode Solutions/Array and String/Array Partition I/Array Partition I.java
class Solution {
    public int arrayPairSum(int[] nums) {
        Arrays.sort(nums);
        int sum = 0;
        for (int i = 0; i<nums.length; i+=2)
            sum += nums[i];
        return sum;
    }
}