programming language/Structure
std::stack, std::queue, std::priority_queue
jellylucy
2021. 7. 29. 10:34
std::stack (LIFO)
stack.empty() | |
stack.size() | |
stack.top() | |
stack.push() | |
stack.pop() | |
stack.emplace() |
std::queue (FIFO)
queue.push() | |
queue.pop() |
std::priority_queue
q.push() | |
q.pop() | |
제일 앞에 있는 것이 최대값의 원소이다. 내림차순의 queue. | |
priority_queue <int> pq; priority_queue <int, vector<int>, greater<int>> pq; |
내림차순 디폴트 오름차순 , greater<int> : #include <functional> |