
{
sort(words.begin(),words.end());
//按照长度排序,长度相同就按照字典排序
stable_sort(words.begin(),words.end(),[](const string &a,const string &b){return a.size()=sz的元素
auto wc=find_if(words.begin(),words.end(),[sz](const string &a){return a.size()>=sz;});
//计算满足size()>=sz的元素个数
int count =words.end()-wc;
cout< word={"afsd","asdfas","asdf","sff","ad","sad"};
biggies(word,3);
auto f=[]{return 42;};
cout<
本文参考:C++ Primer第五版



