题目1041:Simple Sorting
来源:互联网 发布:linux宝塔拉黑ip 编辑:程序博客网 时间:2024/06/05 16:09
- 题目描述:
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.
- 样例输入:
68 8 7 3 7 7
- 样例输出:
3 7 8
C++代码:
#include<iostream>#include<vector>#include<algorithm>using namespace std;vector<int> v;int n;int main(){ while(cin>>n){ for(int i=0;i<n;i++){ int a; cin>>a; v.push_back(a); } sort(v.begin(),v.end()); cout<<v[0]; int m = v[0]; for(int i=1;i<v.size();i++){ if(v[i]!=m){ cout<<" "<<v[i]; m=v[i]; } } cout<<endl; v.clear(); } return 0;}
阅读全文
0 0
- 题目1041:Simple Sorting
- 题目1041:Simple Sorting
- 题目1041:Simple Sorting
- 题目1041:Simple Sorting
- 九度OJ 题目1041:Simple Sorting
- 九度OJ题目1041:Simple Sorting
- 九度OJ题目1041:Simple Sorting解题报告
- 九度oj-1041-Simple Sorting
- 1041.Simple Sorting
- 九度OJ 1041 Simple Sorting (排序,STL)
- Sorting Algorithm-Simple Selection Sort
- 九度OJ 1041:Simple Sorting(简单排序) (排序)
- 九度OJ1041-Simple Sorting【快排】
- Analysis and implement some simple sorting algorithm.(1)
- 北京ICPC题目3 : A Simple Job
- PE 题目 NBUT 1226A Simple Triangle
- Sorting
- Sorting:
- VirtualPlanetBuilder入门简介
- 添加对私有数据成员的支持
- 《Metasploit 魔鬼训练营》博客目录
- 客观题 编程综合
- java文件上传
- 题目1041:Simple Sorting
- 把库转换为一个jQuery插件
- 计算机修炼之路--------Tomcat的安装配置
- 单片机C简单定时计数组件
- windows下使用composer为YII框架安装redis扩展
- FreeRTOS_003_让系统在板子上跑起
- java文件下载
- Canvas时钟
- The content of element type "package" must match "(result-types?,interceptors?,default-interceptor-r