UVA11462-(Age sort)（计数排序）

You are given the ages (in years) of all people of a country with at least 1 year of age. You know that no individual in that country lives for 100 or more years. Now, you are given a very simple task of sorting all the ages in ascending order.

 

Input

There are multiple test cases in the input file. Each case starts with an integer n (0<n<=2000000), the total number of people. In the next line, there are n integers indicating the ages. Input is terminated with a case where n = 0. This case should not be processed.

 

Output

For each case, print a line with n space separated integers. These integers are the ages of that country sorted in ascending order.

 

Warning: Input Data is pretty big (~  25 MB) so use faster IO.

 

Sample Input                             Output for Sample Input

5

3 4 2 1 5

5

2 3 2 3 1

0

1 2 3 4 5

1 2 2 3 3

Note: The memory limit of this problem is 2 Megabyte Only.

分析：数据大、内存小-计数排序

#include<iostream>#include<string.h>#include<stdio.h>#include<ctype.h>#include<algorithm>#include<stack>#include<queue>#include<set>#include<math.h>#include<vector>#include<map>#include<deque>#include<list>using namespace std;int a[105];int w;int i,j;int main(){    int t;    while(scanf("%d",&t)&&t!=0)    {        memset(a,0,sizeof(a));        for(i=0;i<t;i++)        {            scanf("%d",&w);            a[w]++;        }        int p=1;        for(i=0;i<105;i++)        for(j=0;j<a[i];j++)        {            if(!p)            printf(" ");            p=0;            printf("%d",i);        }        printf("\n");    }    return 0;}