E题求帮助 76.92%
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;
cin >> T;
while(T --){
int n;
cin >> n;
int a[n];
for(int i = 0;i < n;i ++) cin >> a[i];
sort(a , a + n);
int half = n / 2;
int h1 = 0, h2 = 0;
if(half % 2 == 0){
h1 = (a[half / 2 - 1] + a[half / 2]) / 2;
h2 = (a[n - (half / 2 - 1) - 1] + a[n - (half / 2) - 1]) / 2;
}else{
h1 = a[half / 2];
h2 = a[n - half / 2 - 1];
}
//cout << h1 << ' ' << h2 << endl;
long long cost = 0;
if(h1 != h2){
for(int i = 0;i < half;i ++){
cost += abs(a[i] - h1);
}
for(int i = half;i < n;i ++){
cost += abs(a[i] - h2);
}
}else{
for(int i = 0;i < half;i ++){
cost += abs(a[i] - (h1 - 1));
}
}
cout << cost << endl;
}
return 0;
}
拼多多集团-PDD公司福利 780人发布
投递58到家等公司7个岗位