HDU ACM 11 2083 简易版之最短距离

#include <iostream>#include <algorithm>#include <cmath>using namespace std;int main(){int T;cin >> T;int n;int Lu[502];while (T--){cin >> n;int i;for (i = 1; i<= n; i++)cin >> Lu[i];sort(Lu + 1, Lu + n + 1);int sum = 0;for (int j = 1; j <= n; j++)sum += abs(Lu[i/2] - Lu[j]);cout << sum << endl;}return 0;}