题解 1169: 绝对值排序(c语言)

参考代码:

#include<stdio.h>
int main()
{
     int n;
     while(scanf("%d",&n)!=EOF)
     {
         if(n==0)
            break;
        int a[n];
        int b[n];
        int i=0;
        int q=n;
         while(q--)
         {
             scanf("%d",&a[i]);
             b[i]=a[i];
             if(a[i]<0)
                {
                    a[i]=-a[i];
                }
                i++;

         }
         for(int k=0;k<n-1;k++)
            for(int m=k;m<n;m++)
         {
             if(a[m]>a[k])
             {
                 int t=0;
                 t=a[m];
                 a[m]=a[k];
                 a[k]=t;
             }
         }
         for(int x=0;x<n;x++)
         for(int y=0;y<n;y++)
         {
             if(a[x]==-b[y])
             {
                 a[x]=b[y];
             }
         }
         for(int x=0;x<n;x++)
         {
             if(x!=n-1)
              printf("%d ",a[x]);
              else
            printf("%d\n",a[x]);
         }
     }
        return 0;
}