要用队列 已AC Answer Confused ，请放心食用

#include <iostream>
#include <queue>
using namespace std;
int n,x,cnt=0;
queue<int> que;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){cin>>x;que.push(x);}
    while(!que.empty()){
        if(++cnt%2){cout<<que.front()<<' ';que.pop();}
        else {que.push(que.front());que.pop();}
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n, head, tail;
int main()
{
    cin >> n;
    int q[2050] = {}, head, tail;
    for (int i = 1; i <= n; i++)
    {
        cin >> q[i];
    }
    head=1;
    tail=n+1;
    while(head<tail)
    {
        cout << q[head] << " ";
        head++;
        q[tail]=q[head];
        tail++;
        head++;
    }
    return 0;
}