STL复习：
1:   vector
vector<**> a
传入: a.push_back(x),a.insert(postion,x);
vector.size(),vector.begin(),vector.end(),vector.front(),vector.back(),vector.pop_back()
vector.erase(postion),vector.find(x)(返回地址)，vector.count(x),vector.clear(),vector.empty();
2：  set
set<**> a;
set.begin(),set.end(),set.insert(x),set.count(),set.erase(x),set.size(),set.find()
set.lower_bound(),set.upper_bound(),set.empty(),set.clear;
3:   queue
queue<**> q;
queue.front(),queue.back(),queue.push(),queue.pop()//先入先出
queue.size(),queue.empty()
4:   priority_queue
priority_queue<**> heap(),priority_queue<**,vector<**>,greater<**>> heap(小根堆)
heap.push(),heap.pop(),heap.top(),heap.size,heap.empty()
5:   stack
stack<**> sk;
stack.push(),stack.pop()//后入先出，stack.top(),stack.size(),stack.empty()
6:   deque
deque<**> dq;
deque.front(),deque.back(),deque.begin(),deque.end(),
deque.push_front(),deque.push_back()(pop一样)
deque.size(),deque.clear(),deque.empty()
7:    map
map<key,**> mp
mp.begin(),mp.end(),mp.first(),mp.second(),mp[**]=x,mp.insert({}),mp.erase(迭代器)，mp.size(()，mp.find(),mp.count(),mp.clear()