Array Partition I[LeetCode 561]

Ans

---

#include <iostream>#include <vector>#include <algorithm>using namespace std;class Solution {public:    int arrayPairSum(vector<int>& nums) {        sort(nums.begin(), nums.end());        int ans = 0;        for (int i = 0; i < nums.size(); i += 2) {            ans += nums[i];        }        return ans;    }};