c++ 容器使用 vector

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
const int maxn = 1000;

int main()
{
	// 创建vector
	vector<int> a; 
	
	// 尾部添加元素
	for (int i = 0; i < 8; i++) 
		a.push_back(i);
		
	// 实际个数
	cout << a.size() << "\n";
	
	// 尾部推出元素
	for (int i = 0; i < 8; i++) 
		a.pop_back();
	cout << a.size() << "\n";
	
	a.push_back(1);
	// 清理所有元素
	a.clear();                
	cout << a.size() << "\n";

	a.push_back(5);
	a.push_back(6);
	a.push_back(2);
	// 排序 升序
	sort(a.begin(), a.end());
	for (int i = 0; i < a.size(); i++)
		cout << a[i] << " ";
		
	// 排序 降序
	reverse(a.begin(), a.end());
	for (int i = 0; i < a.size(); i++)
		cout << a[i] << " ";
	cout << "\n" << a.size();
	
	// 重置a的大小
	a.resize(10);
	cout << "\n" << a.size() << "\n";
	
	// 声明迭代器
	vector<int>::iterator the;
	for (the = a.begin(); the != a.end(); the++)
	{
		cout << *the << " ";
	}
	
	// 声明二维vector
	int n = 5, m = 4;
	vector<vector<int>> thy(n, vector<int>(m));
	for (int i = 0; i < thy.size(); i++)
	{
		for (int j = 0; j < thy[i].size(); j++)
			cout << thy[i][j];
	}
}