AC代码1(根据以上分析得出)
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 100010;
int a[N],res;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int i=0;
n--;
while(i<n){
res+=a[n]-a[i];
i++;
n--;
}
cout << res << endl;
return 0;
}
AC代码2(y总)
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 100010;
int a[N],res;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
//选取到n/2
for (int i = 0; i < n; i++) {
res += abs(a[i]-a[n/2]);
}
cout << res << endl;
return 0;
}