561. Array Partition I（LeetCode）

Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.

Example 1:

Input: [1,4,3,2]

Output: 4
Explanation: n is 2, and the maximum sum of pairs is 4.

 

Note:

1. n is a positive integer, which is in the range of [1, 10000].
2. All the integers in the array will be in the range of [-10000, 10000].

    

    1 #include<iostream>
    2 #include<vector>
    3 #include<algorithm>
    4 using namespace std;
    5 class Solution {
    6 public:
    7     int arrayPairSum(vector<int>& nums) {
    8         sort(nums.begin(), nums.end());
    9         int n = nums.size();
   10         int sum = 0;
   11         for (int i = 0; i < n; i += 2)
   12         {
   13             sum += nums[i];
   14         }
   15         return sum;
   16     }
   17 };
   18 int main()
   19 {
   20     vector<int> num{ 1, 4, 3, 2 };
   21     Solution s;
   22     cout << s.arrayPairSum(num) << endl;
   23     system("pause");
   24     return 0;
   25 }

    

转载于:https://www.cnblogs.com/wujufengyun/p/6755838.html