#include<iostream> #include<stdio.h> #include<stdlib.h> #include<math.h> #include<string.h> #include<algorithm> #include<map> #include<vector> #include<queue> using namespace std; //排序,后减前即min集合之差,n%2即后减前数量差 int main(){ int n,sum=0,halfsum=0; scanf("%d",&n); vector<int>v(n); for(int i=0;i<n;i++){ scanf("%d",&v[i]); sum+=v[i]; } sort(v.begin(),v.end()); for(int i=0;i<n/2;i++){ halfsum+=v[i]; } printf("%d %d",n%2,sum-2*halfsum); system("pause"); return 0; }