直接上题目吧:
我的思路是直接将原先的数组排好序,然后用后面的减去前面的就行,如果个数为奇数个就直接后面多一个减去前面的即可。
#include <iostream>
using namespace std;
const int N = 100010;
int q[N];
void quick_sort(int n,int l,int r){
int i,j;
if(l>=r) return;
int mid = (l+r)>>1;
// cout<<mid<<endl;
int value = q[mid];
// cout<<"l:"<<l<<" "<<"r:"<<r<<"value:"<<value<<endl;
i = l-1, j = r+1;
while(i<j){
do i++;while(q[i]<value);
do j--;while(q[j]>value);
// cout<<q[i]<<" "<<q[j]<<endl;
if(i<j) swap(q[i],q[j]);
}
quick_sort(n,l,j);
quick_sort(n,j+1,r);
return;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>q[i];
//y总快排
quick_sort(n,0,n-1);
int sum1 = 0;
int sum2 = 0;
// cout<<n/2<<endl;
if(n%2==0){
for(int i=0;i<n/2;i++){
sum1 = q[i] + sum1;
}
for(int i=n/2;i<n;i++){
sum2 = q[i] + sum2;
}
cout<<0<<" "<<sum2 - sum1;
}else{
for(int i=0;i<n/2;i++){
sum1 = q[i] + sum1;
}
for(int i=n/2;i<n;i++){
sum2 = q[i] + sum2;
}
cout<<1<<" "<<sum2 - sum1;
}
return 0;
}