【PAT】L2-017. 人以群分【C语言快排实现】

#include <stdlib.h>
int cmp(const void *a,const void *b){
  return *(int *)a<*(int *)b;
} 
int a[100001];
int main(){
  int n,m;
  while(scanf("%d",&n)!=EOF){
    int i;
    for(i=0;i<n;i++){
      scanf("%d",&a[i]);
    }
  qsort(a,n,sizeof(a[0]),cmp);
  if(n%2==0){
    m=n/2;
  }
  else{
    m=n/2+1;
  }
  int s1=0,s2=0;
  
    for(i=0;i<m;i++){
      s1+=a[i];
    }
    for(i=m;i<n;i++){
      s2+=a[i];
    }
    if(n%2==0)
      printf("Outgoing #: %d\nIntroverted #: %d\nDiff = %d\n",m,m,s1-s2);
    else
      printf("Outgoing #: %d\nIntroverted #: %d\nDiff = %d\n",m,m-1,s1-s2);  
  }
  
  
  return 0;
}