#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
using namespace std; 
int main4()
 {  
	/*
	int iarr[] = {30, 12, 55, 31, 98, 11, 41, 80, 66, 21};   
	vector<int> ivector(iarr, iarr + 10);     // 排序     
	sort(ivector.begin(), ivector.end());    
	for(vector<int>::iterator it = ivector.begin();it != ivector.end();it++)
	{   
		cout << *it << " ";   
	}    
	cout << endl;  
	cout << "輸入搜尋值：";  
	int search = 0;  
	cin >> search;    
	vector<int>::iterator in =find(ivector.begin(), ivector.end(), search);   
	if(in != ivector.end()) 
	{       
		cout << "找到搜尋值！" << endl;   
	}    
	else 
	{       
		cout << "找不到搜尋值！" << endl;   
	}    
	// 反轉   
	reverse(ivector.begin(), ivector.end());  
	for(vector<int>::iterator im = ivector.begin();im != ivector.end();im++)
	{         
		cout << *im << " ";   
	}  
	*/
	/*
	vector<char> vec;
    char arr[]="abcdefg";
	vec.assign(arr,arr+2);
	for(vector<char>::iterator it=vec.begin();it!=vec.end();it++)
	{
		cout.put(*it);
	}
    */
	vector<string>menulist,bb;
  	string arr[]={"1.add stu info",
					   "2.sort stu info",
					   "3.print stu info",
					   "4.search stu info"};
	//cout<<arr[1];
	//string ch ="dfdsf";
	menulist.assign(arr,arr+4);
	
	
	//cout<<endl;
	//cout<<menulist.at(2)<<endl;
    //string aa =menulist.back();
	//cout<<aa<<endl;
	//cout<<*menulist.begin()<<endl;
	//cout<<menulist.capacity()<<endl;
	//cout<<menulist.size()<<endl;
	//menulist.clear();
    //cout<<menulist.capacity()<<endl;
	//cout<<menulist.size()<<endl;
	//cout<<menulist.empty()<<endl;
	//cout<<*(menulist.end()-1)<<endl;
	//menulist.erase(menulist.begin());

    //cout<<menulist.size()<<endl;
	//string aa =menulist.front();
	//cout<<aa<<endl;
	//menulist.insert(menulist.end(),arr,arr+3);
	//cout<<*menulist.rbegin()<<endl;
	//cout<<*(menulist.rend()-1)<<endl;
	//cout<<menulist.at(0)<<endl;
	reverse(menulist.begin(),menulist.end());
	//menulist.swap(bb);
	//bb.swap(menulist);
	
	for(vector<string>::iterator str=menulist.begin();str!=menulist.end();str++)
	{
		cout<<*str<<endl;
	}
	cout<<menulist.max_size()<<endl;
	
	return 0;
}