92、93、94

#include <functional>
#include <iostream>
#include <vector>
#include <algorithm>
#include <boost/lambda/lambda.hpp>
using namespace std;
using namespace boost::lambda;

int main() {
 int intArr[] = { 30, 90, 10, 40, 70, 50, 20, 80 };
 const int N = sizeof(intArr) / sizeof(int);
 vector<int> a(intArr, intArr + N);
 vector<int>::iterator p = find_if(a.begin(), a.end(), _1 > 40);
 if (p == a.end())
  cout << "no element greater than 40" << endl;
 else
  cout << "first element greater than 40 is: " << *p << endl;
 return 0;
}

#include <iostream>
#include <string>
#include <utility>
#include <boost/unordered_map.hpp>
using namespace std;
using namespace boost;

int main() {
 unordered_map<string, int> courses;
 //将课程信息插入courses映射中
 courses.insert(make_pair("CSAPP", 3));
 courses.insert(make_pair("C++", 2));
 courses.insert(make_pair("CSARCH", 4));
 courses.insert(make_pair("COMPILER", 4));
 courses.insert(make_pair("OS", 5));

 int n = 3; //剩下的可选次数
 int sum = 0; //学分总和
 while (n > 0) {
  string name;
  cin >> name; //输入课程名称
  unordered_map<string, int>::iterator iter = courses.find(name);//查找课程
  if (iter == courses.end()) { //判断是否找到
   cout << name << " is not available" << endl;
  } else {
   sum += iter->second; //累加学分
   courses.erase(iter); //将刚选过的课程从映射中删除
   n--;
  }
 }

 cout << "Total credit: " << sum << endl; //输出总学分
 return 0;
}

#include <deque>
#include <iostream>
using namespace std;

int main()
{
 deque<int> iDeque;
 iDeque.push_back(3);
 iDeque.push_back(1);
 iDeque.push_back(4);
 iDeque.push_back(8);
 iDeque.push_back(6);
 while (!iDeque.empty()) {
  cout << "取出元素" << iDeque.front() << endl;
  iDeque.pop_front();
 }
 return 0;
}