首页 > 试题广场 >

Simple Sorting

[编程题]Simple Sorting
  • 热度指数:5228 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 64M,其他语言128M
  • 算法知识视频讲解
You are given an unsorted array of integer numbers. Your task is to sort this array and kill possible duplicated elements occurring in it.

输入描述:
For each case, the first line of the input contains an integer number N representing the quantity of numbers in this array(1≤N≤1000). Next N lines contain N integer numbers(one number per each line) of the original array.


输出描述:
For each case ,outtput file should contain at most N numbers sorted in ascending order. Every number in the output file should occur only once.
示例1

输入

6
8 8 7 3 7 7

输出

3 7 8

这道题你会答吗?花几分钟告诉大家答案吧!

问题信息

难度:
0条回答 5595浏览

热门推荐

通过挑战的用户

查看代码