HDU 2083 简易版之最短距离

直接暴力，对输出示例比较感叹，没有完全读懂题意，前几次输出的都是POSITION，WA了几次

#include <stdio.h>
#include <math.h>
int main ( )
{
    int M,N,shortest[524],sum,min;
    scanf ( "%d", &M );
    while ( M-- )
    {
          scanf ( "%d",&N );
          for ( int i = 0; i < N ; ++i )
                scanf ( "%d",&shortest[i] );
          for ( int i = 0; i < N; ++i )
          {
                sum = 0;
                for ( int j = 0; j < N; ++j )
                      sum += fabs ( shortest[i] - shortest[j] );
                i == 0 ? min = sum : ( min = sum < min ? sum :min );
          }
          printf ( "%d\n" , min );
          min = 0;
    }
}