同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

1525_Easysor

2022-5-16 18:17| 发布者: Hocassian| 查看: 54| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-2-89503884327300-Problem List-采集的数据-后羿采集器.html

Pro.ID

1525

Title

Easy sort

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=1525

AC

Submit

Ratio

76.25%

时间&空间限制

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

描述

You know sorting is very important. And this easy problem is:

Given you an array with N non-negative integers which are smaller than 10,000,000, you have to sort this array. Sorting means that integer with smaller value presents first.

输入

The first line of the input is a positive integer T. T is the number of the test cases followed.

The first line of each test case is a positive integer N ( 1 ≤ N ≤ 1000 ) which represents the number of integers in the array. After that, N lines followed. The i-th line is the i-th integer in the array.

输出

Description

You know sorting is very important. And this easy problem is:

Given you an array with N non-negative integers which are smaller than 10,000,000, you have to sort this array. Sorting means that integer with smaller value presents first.

Input

The first line of the input is a positive integer T. T is the number of the test cases followed.

Output

The output of each test case should consist of N lines. The i-th line is the i-th integer of the array after sorting. No redundant spaces are needed.

Sample Input

2
3
1
2
3
1
1

Sample Output

1
2
3
1