HDU 2083 Simple version of the shortest distance

http://acm.hdu.edu.cn/showproblem.php?pid=2083

Median, A,b,c is 3 points, if C is between a A and a, then C to a, B and for (B-A), if C<a or a>b, then C to a, b distance and certainly greater than (B-A).

So find the middle point on the line. If it is an odd number, the middle point is one, and if it is an even number, the two intermediate points will be selected.

The code is as follows:

#include <stdio.h>#include<math.h>#include<algorithm>using namespacestd;intMain () {intm;  while(SCANF ("%d", &m)! =EOF) {         while(m--)        {            intn,x[ -]; scanf ("%d",&N);  for(intI=0; i<n;i++) {scanf ("%d",&X[i]); } sort (X,x+N); intsum=0;  for(intI=0; i<n;i++) Sum+=abs (x[i]-x[n/2]); printf ("%d\n", sum); }    }    return 0;}

HDU 2083 Simple version of the shortest distance