「1113」Integer Set Partition

Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A1​ and A2​ of n1​ and n2​ numbers, respectively. Let S1​ and S2​ denote the sums of all the numbers in A1​ and A2​, respectively. You are supposed to make the partition so that ∣n1​−n2​∣ is minimized first, and then ∣S1​−S2​∣ is maximized.

Input Specification:

Each input file contains one test case. For each case, the first line gives an integer  , and then N positive integers follow in the next line, separated by spaces. It is guaranteed that all the integers and their sum are less than  .

Output Specification:

For each case, print in a line two numbers: ∣n1​−n2​∣ and ∣S1​−S2​∣, separated by exactly one space.

Sample Input 1:

10
23 8 10 99 46 2333 46 1 666 555

Sample Output 1:

0 3611

Sample Input 2:

13
110 79 218 69 3721 100 29 135 2 6 13 5188 85

Sample Output 2:

1 9359

---

Ω

小学生题，把一个数组分为两组，先使得两组大小相差最小，然后再使两组和之差最大。很显然排个序从中间切开就好了。

然后发现求和也有库函数——accumulate：

#include <numeric>
template<class InputIt, class T>
constexpr // since C++20
T accumulate(InputIt first, InputIt last, T init)
{
    for (; first != last; ++first)
        init = std::move(init) + *first; // std::move since C++20
    return init;
}

指定求和数组结尾的迭代器和初始值init，最后就会得到相应区间之和+init。

---

🐎

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> a(n);
    for (auto &k: a)
        cin >> k;
    sort(a.begin(), a.end());
    cout << n % 2 << " " << accumulate(a.begin() + n / 2, a.end(), 0) - accumulate(a.begin(), a.begin() + n / 2, 0);
}