Array Partition I[LeetCode 561]

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/cyrususie/article/details/78706645

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;
    }
};