51nod 1108 距离之和最小 V2

#include <bits/stdc++.h>using namespace std;long long x[10010],y[10010],z[10010];int main(){long long i,n,ans,midx,midy,midz;while(cin>>n){for(i=0;i<n;i++)scanf("%lld%lld%lld",&x[i],&y[i],&z[i]);sort(x,x+n);sort(y,y+n);sort(z,z+n);midx=x[n>>1];midy=y[n>>1];midz=z[n>>1];ans=0;for(i=0;i<n;i++){ans+=abs(midx-x[i]);ans+=abs(midy-y[i]);ans+=abs(midz-z[i]);}printf("%lld\n",ans);}}