uva 11462 - Age Sort

#include <cstdio>
#define max 2000005

int main()
{
int n, age[max], i, j, m;
while(scanf("%d", &n), n)
{
m = 0;
for(i = 1; i <= n; i++)
scanf("%d", &age[i]);

for(i = 0; i <= 110; i++)
for(j = 1; j <= n; j++)
{
if(age[j] == i && m < n - 1)
printf("%d ", i), m++;
else if(age[j] == i && m == n - 1)
printf("%d\n", i), m++;
if(m == n) break;
}
}
return 0;
}

#include<algorithm>
#include<cstdio>
using namespace std;
int a[2000005],i,n;

int main()
{
while (scanf("%d",&n)!=EOF, n)
{
for(i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a+n);
for(i = 0; i < n - 1; i++)
printf("%d ", a[i]);
printf("%d\n", a[n-1]);
}
return 0;
}