4300: Crunching Numbers Just for You

内存限制:256 MB 时间限制:2 S
题面:传统 评测方式:文本比较 上传者:
提交:1 通过:1

题目描述

F. Crunching Numbers Just for You
time limit per test
2 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output
You are developing a new feature for the website which sells airline tickets: being able to sort tickets by price! You have already extracted the tickets' prices, so there's just the last step to be done...
You are given an array of integers. Sort it in non-descending order.
Input
The input consists of a single line of space-separated integers. The first number is n (1≤n≤10) − the size of the array. The following n numbers are the elements of the array (1≤ai≤100).
Output
Output space-separated elements of the sorted array.
Example
Input
3 3 1 2
Output
1 2 3 
Note
Remember, this is a very important feature, and you have to make sure the customers appreciate it!


您正在为销售机票的网站开发一个新功能:能够按价格排序机票!你已经提取了门票的价格,所以只有最后一步要做。。。

给你一个整数数组。按非降序排序。


输入格式

输入由一行空格分隔的整数组成。第一个数字是n(1≤n≤10)−阵列的大小。以下n个数字是数组的元素(1≤ai≤100)。

输出格式

输出排序数组的空格分隔元素。

输入样例 复制

3 3 1 2

输出样例 复制

1 2 3 

数据范围与提示

记住,这是一个非常重要的功能,您必须确保客户欣赏它