#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<string>
using namespace std;
typedef long long LL;
const int INF=0x3f3f3f3f;
const int N=1e5+10;
const int eps=1e-5;
LL n,a[100010],ans;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++)
        ans+=abs(a[i]-a[n/2+1]);
    cout<<ans;
    return 0;
}

拿下纪录短代码

普通做法

//短代码
#include<bits/stdc++.h>
using namespace std;
int main(){
	int a[100005],n,ans=0;cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];       sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)ans+=abs(a[i]-a[n/2+1]);
	cout<<ans;
}

兄弟们我一雪前耻了！！！

就是这道题害我中级班期末考试少了80分，今日直接拿下~

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
const int INF=0x3f3f3f3f;
int n,a[N],ans; 
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)
	{
		ans+=abs(a[i]-a[n/2]);
	}
	cout<<ans;
	return 0;
}

tips：货仓选择在中间店铺最省力

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF=0x3f3f3f3f;
const int N=1e5+10;
const int eps=1e-5;
LL n,a[100010],ans;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++)
        ans+=abs(a[i]-a[n/2+1]);
    cout<<ans;
    return 0;
}

#include<iostream> #include<math.h> #include<algorithm> #include<cstdio> using namespace std; const int maxn=1e5+5; int a[maxn]; int n; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; sort(a+1,a+1+n); int ans=0; for(int i=1;i<=n;i++) { ans+=abs(a[i]-a[n/2+1]); } cout<<ans<<endl; }

#include<algorithm> #include<cmath> #include<cstdio> #include<cstring> #include<fstream> #include<iomanip> #include<iostream> #include<string> using namespace std; typedef long long LL; const int INF=0x3f3f3f3f; const int N=1e5+10; const int eps=1e-5; LL n,a[100010],ans; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; sort(a+1,a+1+n); for(int i=1;i<=n;i++) ans+=abs(a[i]-a[n/2+1]); cout<<ans; return 0; }