绝对值排序
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 40110 Accepted Submission(s): 19631
3 3 -4 2 4 0 1 2 -3 0
-4 3 2 -3 2 1 0
#include<stdio.h>
int main()
{
int n,m,i,j;
int a[110],b[110];
while(scanf("%d",&n)!=EOF&&(n!=0))
{
for(i=0;i<n;i++)
{
scanf("%d",&b[i]);
a[i]=b[i];
a[i]=(a[i]>0?a[i]:(-a[i]));
}
for(i=0;i<n;i++)
{
for(j=0;j<n-1;j++)
{
if(a[j]<a[j+1])
{
m=a[j];a[j]=a[j+1];a[j+1]=m;
m=b[j];b[j]=b[j+1];b[j+1]=m;
}
}
}
for(i=0;i<n;i++)
{
if(i!=n-1)
printf("%d ",b[i]);
else
printf("%d\n",b[i]);
}
}
return 0;
}
//怎样把未知数个负数输出