561.数组拆分 I

🥛  

class Solution {
public:
    int arrayPairSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int i = 0,
        tl = 0;
        while(i != nums.size()) {
            tl += nums[i];
            i += 2;
        }
        return tl;
    }
};

Accepted

81/81 cases passed (96 ms)

Your runtime beats 21.52 % of cpp submissions

Your memory usage beats 5.28 % of cpp submissions (11.6 MB)