C++容器整理

1，排序函数

#include <algorithm>

using namespace std;

bool cmp(int a, int b)
{
	return a < b;
}

int main()
{
	vector<int> myvec{ 3, 2, 5, 7, 3, 2 };
	vector<int> lbvec(myvec);

	sort(myvec.begin(), myvec.end(), cmp);

	for (auto itr = myvec.begin(); itr != myvec.end(); itr++)
	{
		cout << *itr << endl;
	}

	getchar();
	return 0;
}