51Nod 1096 距离之和最小

排序找中位数

#include<iostream>  #include<queue>  #include<vector>  #include<stack>  #include<algorithm>#include<cmath> #include<set>#include<map>#include<cstdio>using namespace std;int main(){int n;scanf("%d",&n);int a[10001];for(int i=0;i<n;i++){scanf("%d",&a[i]);}sort(a,a+n);int mid=n/2;long long sum=0;for(int i=0;i<n;i++){sum+=abs(a[mid]-a[i]);}long long sum2=0;for(int i=0;i<n;i++){sum2+=abs(a[mid-1]-a[i]);}printf("%lld",min(sum,sum2));return 0;}