SORT
DECENDING
sort my way
sort(a,a+n,comp);
pairs
vectors
for(auto i : v){
cout<<i<<endl;
}
List
dequeue
stack
lifo
.push(1);
st.top();
st.pop();
size()
empty()
queue
priority_queue // max heap //logn
priority_queue<int>pq;
.top()
.pop()
.push()
minimum heap
set
multiset<int>ms;
unordered_set<int> st;
Map LOGN