• [1324] Eyes Right

  • 时间限制: 2300 ms 内存限制: 1000 K
  • 问题描述
  • OK, now Mr.Cai confirmed that TT can go out. To make tt more stronger, Mr.Cai gave TT some manpowers. Their age ranges from young to old. In order not to be mess, TT wanted to sort them, from young to old.
  • 输入
  • There are many cases. first there is a integet N(1 <= N <= 2500000),means there are N people, next line contains N numbers(1 <= N <= 100), means their ages.
  • 输出
  • For each case, printed the sorted array.
  • 样例输入
  • 5
    10 24 66 15 22
    5
    5 4 3 2 1
  • 样例输出
  • 10 15 22 24 66
    1 2 3 4 5
  • 提示
  • 来源
  • Mr.Cai
  • 操作

显示春菜