« Inbuilt Queue use

Copy
1#include <iostream>
2#include <iomanip>
3#include <algorithm>
4#include <string>
5#include <cstring>
6#include <vector>
7#include <cmath>
8#include <map>
9#include <climits>
10// climits for INT_MIN
11#include <unordered_map>
12#include <queue>
13using namespace std;
14int main()
15{
16    queue<int> q;
17    q.push(10);
18    q.push(20);
19    q.push(30);
20    q.push(40);
21    q.push(50);
22    q.push(60);
23    q.push(70);
24
25    cout << q.front() << endl;
26    cout << q.size() << endl;
27    q.pop();
28    q.pop();
29    q.pop();
30    cout << q.front() << endl;
31    cout << q.size() << endl;
32
33    return 0;
34}