#include <iostream> #include <vector>usingnamespacestd;
int main (void) {
vector<int>array;
//初始化 for (int i = 0; i < 5; i++) {
int temp;
cin>>temp;
array.push_back(temp);
}
//简单遍历 for (int i=0;i<5;i++) {
cout<<array[i]<<" ";
}
return0;
}
简单排序
#include <iostream> #include <vector>#include <algorithm>usingnamespacestd;
int main (void) {
vector<int>array;
//初始化 for (int i = 0; i < 5; i++) {
int temp;
cin>>temp;
array.push_back(temp);
}
//简单遍历 for (int i=0;i<5;i++) {
cout<<array[i]<<" ";
}
//从小到大
sort(array.begin(), array.end());//用到sort、reverse函数需要包含头文件 algorithm //之后再反转就是从大到小了
reverse(array.begin(), array.end());
//简单遍历 for (int i=0;i<5;i++) {
cout<<array[i]<<" ";
}
return0;
}