Age Sort
Input: Standard Input
Output: Standard Output
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
The memory limit for this problem is 2 Megabyte only.
Problem Setter: Mohammad Mahmudur Rahman
Special Thanks: Shahriar Manzoor
Input: Standard Input
Output: Standard Output
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
The memory limit for this problem is 2 Megabyte only.
Problem Setter: Mohammad Mahmudur Rahman
Special Thanks: Shahriar Manzoor
內存有限制,計數排序,加上讀入優化更快。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
int n,x,c[101];
char s[5];
while(~scanf("%d",&n),n)
{
memset(c,0,sizeof(c));
for(int i=0;i<n;i++)
{
x=0;
scanf("%s",s);
for(int k=0;s[k];k++)
{
x=x*10+s[k]-'0';
}
c[x]++;
}
for(int i=0;i<=100;i++)
{
for(int j=0;j<c[i];j++)
{
printf("%d",i);
n--;
if(n)printf(" ");
}
}
printf("\n");
}
}