#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> v;
int main()
{
int n,sum1=0,sum2=0,temp;
cin>>n;
cout<<n%2<<" ";
for(int i=0;i<n;i++)
{
cin>>temp;
v.push_back(temp);
}
sort(v.begin(),v.end());
if(n%2==0)
{
int i;
for(i=0;i<n/2;i++)
sum1+=v[i];
for(;i<n;i++)
sum2+=v[i];
cout<<sum2-sum1<<endl;
}
else
{
int i;
for(i=0;i<n/2;i++)
sum1+=v[i];
for(;i<n;i++)
sum2+=v[i];
cout<<sum2-sum1<<endl;
}
return 0;
}
1113 Integer Set Partition (
最新推荐文章于 2022-12-23 15:39:10 发布