. Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a₁, b₁), (a₂, b₂), ..., (a_n, b_n) which makes sum of min(a_i, b_i) for all i from 1 to n as large as possible.

Example 1:

Input: [1,4,3,2]

Output: 4

Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).

import java.util.Arrays;

public class ArrayPartition1 { public int arrayPairSum(int[] nums) { Arrays.sort(nums); int sum = 0; for(int i = 0 ; i < nums.length-1; i= i+2){ sum = sum+ Math.min(nums[i],nums[i+1]); } return sum; }

public static void main(String[] args){ int arr[]= {1,4,3,2}; SYstem.out.println(arrayPairSum(nums));

} }

I have this solution..but not working