本文主要是介绍九度oj-1041-Simple Sorting，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
- 题目描述：
-
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.
- 样例输入：
-
6 8 8 7 3 7 7
- 样例输出：
-
3 7 8
- 来源：
- 2008年上海交通大学计算机研究生机试真题
-
-
#include<iostream> #include<set> using namespace std; int main() {int n,i,t;set<int> a;set<int>::iterator j;while(cin>>n){a.clear();for(i=0;i<n;i++){cin>>t;a.insert(t);}j=a.begin();t=a.size();for(i=0;i<t-1;i++,j++)cout<<*j<<" ";cout<<*j<<endl;}return 0; }
这篇关于九度oj-1041-Simple Sorting的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
