vector排序

vector排序

#include <bits/stdc++.h>
using namespace std;
vector<int> a;
int main()
{
	for(int i=1; i<=10; ++i){
		a.push_back(i);
	}
	//降序排 
	sort(a.rbegin(), a.rend());
	for(int i=0; i<a.size(); ++i){
		cout << a[i] << " ";
	}
	cout << endl; 
	//升序排 
	sort(a.begin(), a.end());
	for(int i=0; i<a.size(); ++i){
		cout << a[i] << " ";
	}
	return 0;
}