Array Partition LeetCode solution in C++

1
class Solution {
2
 public:
3
  int arrayPairSum(vector<int> &nums) {
4
    int res = 0;
5
    sort(nums.begin(), nums.end());
6
    for (int i = 0; i < nums.size(); i += 2) {
7
      res += min(nums[i], nums[i + 1]);
8
    }
9
    return res;
10
  }
11
};