STL顺序容器【vector】【deque】【list】

<span style="font-size:10px;">struct Node
{
int num;
int cycle;
int count;
int zong;
bool operator < (const Node &a) const  //比較函数
{
return a.zong<zong;   //首先按zong从小到大，然后按num从小到大。
return a.num<num;
}
};</span>

#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <list>
using namespace std;
#define Del(a,b) memset(a,b,sizeof(a))
const int N = 11000;

int main()
{
/*9.1.1*/
vector<int> ievel;
vector<string> svec;//(get_word_count("Chimera"));
svec.push_back("i ccc");
svec.push_back("yang can");
svec.insert(svec.begin()+1,"momo");
svec.insert(svec.begin()+1,5,"hahha");
string s[10]={"what","is","your","name"};
svec.insert(svec.begin()+1,s,s+4);
vector<string>::iterator i=svec.begin();
svec.erase(i+0);
//svec.erase(i,i+2);
for(int i=0;i<svec.size();i++)
cout<<svec[i]<<endl;
cout<<"---->"<<svec[10]<<endl;
cout<<"xxxxx"<<svec.at(10)<<endl;  //还有一种訪问办法。下标超抛出out_of_range
/*vector<string>::const_reverse_iterator ii;
for(ii=svec.rbegin();ii!=svec.rend();ii--){
cout<<*ii<endl;
}*/
/*list<string> slist(svec.begin(),svec.end());
list<string>::iterator it;
for(it=slist.begin();it!=slist.end();it++)
cout<<*it<<endl;
const list<int>::size_type ll=64;//注意类型
list<string> ls(ll,"eh?");
for(it=ls.begin();it!=ls.end();it++){}
//cout<<*it<<endl;
/*9.1.2
vector<vector<string> > v;
vector<string> s1;
v.push_back(s1);*/
list<int> lis(10,42);
lis.resize(15); //调整容器大小
lis.resize(25,-1); //可选參数初始值
//lis.resize(5);
list<int>::iterator it=lis.begin();
for(;it!=lis.end();it++)
{
cout<<*it<<endl;
}
return 0;
}

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;

struct Node
{
int x;
bool operator < (const Node &a) const
{
return a.x<x;   //首先按zong从小到大
}
};

int main()
{
priority_queue<Node> p;
Node s;s.x=5;
p.push(s);
s.x=10;
p.push(s);
s.x=1;p.push(s);
while(!p.empty())
{
printf("%d\n",p.top());
p.pop();
}
return 0;
}