第十二章贪心 5 AcWing 1603. 整数集合划分-蒲公英云

第十二章贪心 5 AcWing 1603. 整数集合划分

原题链接

AcWing 1603. 整数集合划分

算法标签

贪心

思路

在这里插入图片描述

代码

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define int long long
#define xx first
#define yy second
#define ump unordered_map
#define us unordered_set
#define pq priority_queue
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>=b;--i)
using namespace std;
typedef pair<int, int> PII;
const int N=100005, inf=0x3f3f3f3f3f3f3f3f, mod=1e9+7;
const double Exp=1e-8;
//int t, n, m, cnt, ans;
int w[N];
inline int rd(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n=rd();
    rep(i, 0, n){
        w[i]=rd();
    }
    sort(w, w+n);
    int s1=0, s2=0;
    rep(i, 0, n/2){
        s1+=w[i];
    }
    rep(i, n/2, n){
        s2+=w[i];
    }
    printf("%lld %lld", n%2, s2-s1);
    return 0;
}