计数排序,比堆排快了半秒……
#include
<
stdio.h
>
;
long a[ 1000010 ];
int main() ... {
int i,n,t;
scanf("%d",&n);
for (i=1;i<=n;i++)...{
scanf("%d",&t);
a[t]++;
}
for (i=0;i<=1000000;i++)
while (a[i]>0)
...{printf("%d ",i);
a[i]--;
}
return 0;
}
long a[ 1000010 ];
int main() ... {
int i,n,t;
scanf("%d",&n);
for (i=1;i<=n;i++)...{
scanf("%d",&t);
a[t]++;
}
for (i=0;i<=1000000;i++)
while (a[i]>0)
...{printf("%d ",i);
a[i]--;
}
return 0;
}