STL

set

不重复集合

set<int> st;
st.insert(x);
set<int>::iterator it=st.begin();it!=st.end();it++
cout<<(*it)
st.size()

set<pair<int,int> >q;
cin>>k>>p;
q.insert(make_pair(p,k));
it=q.end(); it得到的是最后一位的下一位 
it--;
cout<<it->second<<endl;
q.erase(it);

map

(map.count()可以判断有无)

#include<iostream>
#include<algorithm> 
#include<map>
using namespace std;
map<string,map<string,int> >table;
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		string fruit,pro;
		int cnt;
		cin>>fruit>>pro>>cnt;
		table[pro][fruit]+=cnt; 
	} 
	map<string,map<string,int> >::iterator it1;
	map<string,int>::iterator it2;
	for(it1=table.begin();it1!=table.end();it1++){
		cout<<it1->first<<endl;
		for(it2=it1->second.begin();it2!=it1->second.end();it2++){
			cout<<"   |----"<< it2->first <<"("<< it2->second <<")"<<endl;
		}
	}
	
	return 0;
}

vector

v.push_back();
sort(v.begin(),v.end());