【2019暑期】【PAT甲级】1113 Integer Set Partition (25 分)

简单题
unsigned int 0～4294967295 (10位数，4e9)

int -2147483648～2147483647 (10位数，2e9 2^31 - 1)

long long： -9223372036854775808～9223372036854775807 (19位数， 9e18 ) 2^63 - 1

unsigned long long：0～18446744073709551615 (20位数，1e19) 2^64 - 1

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <string>
#include <cctype>
#include <vector>
#include <cstring>
#include <map>
using namespace std;

int n,cnt,sum;
vector<int> ans;

int main()
{
 	
 	cin >> n;
 	for(int i=0; i<n; i++){
 		int a;
 		cin >> a;
 		ans.push_back(a);
	}
	int key1 = n/2, key2 = n - n/2;
	cnt = key2 - key1;
	sort(ans.begin(),ans.end());
	int now1=0,now2=0;
	for(int i=0; i<key1; i++)
		now1 += ans[i];
	for(int i=key1; i<n; i++)
		now2 += ans[i];
	
	sum = now2 - now1;
	cout << cnt << " " << sum << endl;
 	
    return 0;
}