1836665_wa.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>

void main()
{
  int i, j, n, T, p, tmp, a[1010];
  long time, time1, sum;
  scanf("%d",&T); 
  while(T--)
  {
   time = time1 = sum = 0;
   scanf("%d",&n);
   for(i = 0; i < n; i++)
   scanf("%d",&a[i]);
   if(n == 1) {printf("%d\n",a[0]);continue;}
   for(i = 0; i < n - 1; i++)
   {
    p = i;
    for(j = i + 1; j < n; j++)
    if(a[p] > a[j]) p = j;
    if(p != i)
    {
     tmp = a[p];
     a[p] = a[i];
     a[i] = tmp;
    }
   }
   for(i = n - 1; i >= 2; i-=2)
   {
    time = a[i] + a[0] + 2 * a[1];
    if(i == 3) time += a[1];
    if(i == 2) time -= a[1];
    time1 = a[i] + a[i-1] + 2*a[0];
    if(i == 3) time1 += a[1];
    if(i == 2) time1 -= a[0]; 
    sum += time > time1 ? time1 : time;
   }

   printf("%ld\n",sum);
  }
}