排序后划分,直接累加sum=sum+(res[n-i-1]-res[i])即可
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>input;
for(int i=0;i<n;i++){
int key;
cin>>key;
input.push_back(key);
}
sort(input.begin(),input.end());
int sum=0;
for(int i=0;i<n/2;i++){
sum=sum+(input[n-i-1]-input[i]);
}
if(n%2==0)
cout<<0<<' '<<sum<<endl;
else cout<<1<<' '<<sum+input[n/2]<<endl;
return 0;
}