C++ Lab13 Deque Stack Queue

#include <iostream>
#include <deque>
#include <stack>
#include <queue>
#include <functional>
using namespace std;

int main() {
    deque<int> intDeque;
    intDeque.push_back(3); intDeque.push_back(1); intDeque.push_back(2);
    intDeque.push_front(4); intDeque.push_front(6); intDeque.push_front(5);
    cout << "Deque: " << endl;
    for (int i = 0; i < intDeque.size(); ++i) {
        cout << intDeque[i] << " ";
    }
    cout << endl << endl;

    stack<int> intStack;
    intStack.push(3); intStack.push(1); intStack.push(2);
    intStack.push(4); intStack.push(6); intStack.push(5);
    cout << "Stack: " << endl;
    while (!intStack.empty()) {
        cout << intStack.top() << " ";
        intStack.pop();
    }
    cout << endl << endl;

    queue<int> intQueue;
    intQueue.push(3); intQueue.push(1); intQueue.push(2);
    intQueue.push(4); intQueue.push(6); intQueue.push(5);
    cout << "Queue: " << endl;
    while (!intQueue.empty()) {
        cout << intQueue.front() << " ";
        intQueue.pop();
    }
    cout << endl << endl;

    priority_queue<int> intPriorQueue;
    intPriorQueue.push(3); intPriorQueue.push(1); intPriorQueue.push(2);
    intPriorQueue.push(4); intPriorQueue.push(6); intPriorQueue.push(5);
    cout << "Priority Queue: " << endl;
    while (!intPriorQueue.empty()) {
        cout << intPriorQueue.top() << " ";
        intPriorQueue.pop();
    }
    cout << endl << endl;

    priority_queue<int, vector<int>, greater<int>> intPriorQueue2;
    intPriorQueue2.push(3); intPriorQueue2.push(1); intPriorQueue2.push(2);
    intPriorQueue2.push(4); intPriorQueue2.push(6); intPriorQueue2.push(5);
    cout << "Another Priority Queue: " << endl;
    while (!intPriorQueue2.empty()) {
        cout << intPriorQueue2.top() << " ";
        intPriorQueue2.pop();
    }
    cout << endl << endl;

    system("pause");
    return 0;
}