(ns array-partition)

(defn array-pair-sum [nums]
  (let [sorted-nums (sort nums)]
    (reduce + (map first (partition-all 2 sorted-nums)))))

(println (array-pair-sum [3 5 2 3])) ; Should print 7

In this Clojure version, we define a function array-pair-sum that takes an array of integers nums as input and returns the maximum sum of the minimum elements in pairs.

The function first sorts the input array nums using the sort function and assigns the sorted array to sorted-nums.

Then, using partition-all 2 sorted-nums, we partition sorted-nums into pairs. Each pair is a vector of two elements.

We use the map function to extract the first element (minimum value) from each pair. The result is a sequence of minimum values.

Finally, we use reduce + to sum up all the minimum values and return the result.

The code example prints the result of calling array-pair-sum with the input array [1 2 3 4], which corresponds to the example given in the original Java code. The expected output is 4.