ACWing算法基础课-货仓选址

1. 货仓选址

题目链接: https://www.acwing.com/problem/content/description/106/

---

参考文献

C++ 代码

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 100010;

int a[N];
int n;

int main()
{
    scanf("%d", &n);
    for (int i=0; i<n; i++) scanf("%d", &a[i]);
    
    sort(a, a+n);
    
    // 存储结果
    int res = 0;
    for (int i=0; i<n; i++) res += abs(a[i]-a[n/2]); 
    
    printf("%d\n", res);
    
    return 0;
}