11462 Age Sort（计数排序）

内存不够用，用计数排序可以解决问题。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<list>
#include<deque>
#include<algorithm>
#include<stack>
#include<queue>
#include<cctype>
#include<sstream>
using namespace std;
#define pii pair<int,int>
typedef long long int LL;
const double eps=1e-;
const int INF=;
const int maxn=+;
int c[],n,x;
int main()
{
    //freopen("in1.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    while(scanf("%d",&n)==&&n)
    {
        memset(c,,sizeof(c));
        for(int i=; i<n; i++)
        {
            scanf("%d",&x);
            c[x]++;
        }
        int first=;
        for(int i=; i<=; i++)
        {
            //cout<<"c"<<i<<':'<<c[i]<<endl;
            if(c[i]>)
            {
                while(c[i]--)
                {
                    if(first==)
                    {
                        first=;
                        printf("%d",i);
                    }
                    else
                    {
                        printf(" %d",i);
                    }
                }
            }
        }
        printf("\n");
    }
    return ;
}