vector类、迭代器、排序

#include <iostream>
#include <vector>
#include <algorithm> 
using namespace std;
int main()
{
	vector<int> a;   //!!!
	a.push_back(1);  //在尾部加入元素 
	a.push_back(56);  
	a.push_back(23); 
	a.push_back(20); 
	a.push_back(15); 
	a.push_back(-23); 
	a.push_back(99); 
	a.pop_back();   //删除最后一个元素 
	for (int i = 0; i < a.size(); i++)  //.size()获取元素个数 
	{
		cout << a[i] << " ";
	}
	cout << endl;
	
	vector<int>::iterator iter = a.begin();   //迭代器 
	while (iter != a.end())   //end()指向最末元素的下一个位置 
	{
		cout << *iter << " ";
		iter++;
	}
	cout << endl;
	
	sort(a.begin(), a.end());   //升序排序 
	for (int i = 0; i < a.size(); i++)  //.size()获取元素个数 
	{
		cout << a[i] << " ";
	}
	cout << endl;
	return 0;
}