【题解】CH0501 排序

题目链接

#include<cstdio>
#include<algorithm>
#include<cmath>
typedef long long ll;
using namespace std;
#define _rep(i,a,b) for(int i=(a);i<=(b);i++)
const int N=1e5+10;
ll a[N];
ll ans=0;
int n;
int main()
{
    //freopen("in.txt","r",stdin);
    scanf("%d",&n);
    _rep(i,1,n)scanf("%lld",&a[i]);
    sort(a+1,a+n+1);
    if(n&1)
        _rep(i,1,n)ans+=abs(a[(n+1)/2]-a[i]);
    else _rep(i,1,n)ans+=abs(a[n/2]-a[i]);
    printf("%lld\n",ans);
    return 0;
}