1113 Integer Set Partition

1113 Integer Set Partition
Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A
​1
​​ and A
​2
​​ of n
​1
​​ and n
​2
​​ numbers, respectively. Let S
​1
​​ and S
​2
​​ denote the sums of all the numbers in A
​1
​​ and A
​2
​​ , respectively. You are supposed to make the partition so that ∣n
​1
​​ −n
​2
​​ ∣ is minimized first, and then ∣S
​1
​​ −S
​2
​​ ∣ is maximized.

Input Specification:
Each input file contains one test case. For each case, the first line gives an integer N (2≤N≤10
​5
​​ ), 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 2
​31
​​ .

Output Specification:
For each case, print in a line two numbers: ∣n
​1
​​ −n
​2
​​ ∣ and ∣S
​1
​​ −S
​2
​​ ∣, 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
分析：不知道为何出现这个题目？？？

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
int main()
{

    vector<int>number;
    int n, temp, n1, n2, s1 = 0 , s2 = 0;
    scanf_s("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf_s("%d", &temp);
        s2 += temp;
        number.push_back(temp);
    }
    sort(number.begin(), number.end());

    if (n % 2) {
        n1= n / 2; n2 = n / 2 + 1;
    }
    else {
        n1 = n2 = n / 2;
    }
    for (int i = 0; i < n1; i++)
        s1 += number[i];
    if (n % 2)
        cout << "1" << " " << s2 - 2*s1;
    else cout << "0" << " "<<s2 - 2*s1;

    return 0;
}