1113. Integer Set Partition (25)

1. 题目见这里

2. 一个一看就会的题目

3. 代码如下：

#include <stdio.h>#include <stdlib.h> #define N 100005 int Cmp(const void *a, const void *b){    return *(int *)b - *(int *)a;}int main(){//  freopen("Data.txt","r",stdin);    int set[N];    int n,i,difference;    scanf("%d",&n);    for(i=0;i<n;i++) scanf("%d",&set[i]);    qsort(set,n,sizeof(set[0]),Cmp);    difference = 0;    for(i=0;i<n;i++){        if(i<(n+1)/2) difference += set[i];        else difference -= set[i];    }    printf("%d %d\n",n%2,difference);    return 0;}