九度oj-1041-Simple Sorting
2015-11-15 12:00
267 查看
时间限制:1 秒
内存限制:32 兆
特殊判题:否
提交:4515
解决:1688
题目描述:
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.
样例输入:
样例输出:
来源:2008年上海交通大学计算机研究生机试真题
内存限制:32 兆
特殊判题:否
提交:4515
解决:1688
题目描述:
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; }
相关文章推荐
- 九度1526
- 九度1025:最大报销额 java
- 九度 题目1026:又一版 A+B java
- 【九度】题目1006:ZOJ问题
- 【九度】题目1005:Graduate Admission
- 【九度】题目1004:Median
- 【九度】题目1003:A+B
- 【九度】题目1002:Grading
- 【九度】题目1001:A+B for Matrices
- 【九度】题目1000:计算a+b
- 三、Hash练习_1156_1
- 三、Hash_1081_1
- 给定两个整数A和B,其表示形式是:从个位开始,每三位数用逗号","隔开。
- 并查集
- JOBDU Q1001
- JOBDU Q1002
- JOBDU Q1003
- JOBDU Q1004
- 九度题目1431解
- 九度--第1001题:A+B for Matrices