队列

#include <iostream>
#include <queue>
using namespace std;
struct Node
{
    int num;
    int w;
}node;
int main()
{
    queue<Node> q;
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        node.num = i;
        cin >> node.w;
        q.push(node);
    }
    while(q.size() >= 2)
    {
        cout << q.front().num << " " << q.front().w << endl;
        q.pop();
        node = q.front();
        q.pop();
        q.push(node);
    }
    cout << "size" << q.size() << endl;
    cout << q.front().w << endl;
    return 0;
}

#include <iostream>
#include <queue>
#include <stdio.h>
using namespace std;

int main()
{
    queue<int> q;
    int n;
    cin >> n;
    int cmp;
    for(int i = 0; i < n; i++)
    {
        cin >> cmp;
        q.push(cmp);
    }
    cout << "size»" << q.size() << endl;
    cout << "队首" << q.front() << endl;
    cout << "队尾" << q.back() << endl;
    while(!q.empty())
    {
        cout << q.front() << endl;
        q.pop();
    }
    return 0;
}