Реализовать кольцевой стек.

#include <iostream>
using namespace std;
 
int main()
{
    int val;
    int last;
    int const size = 100;
    int n = 1;
    int k = 0;
    int queue[size];
    cout<<"Enter the number of the first element"<<endl;
    cin>>val;
    int y = val;
    int top = val;
    if(val<=size)
    {
    while(k < 5)
    {       
            cout<<"Element "<< k + 1<<endl;
            cin>>n;
            if(n != 0)
            {
                queue[val - 1] = n;
                val++;
                last = val - 1;
                k++;
            }
        if(k>=size)
        {k = 0;}
    }
 
    system("pause");
    cout<<"Queue has the form:"<<endl;
    for(int i = 1; i <= k; i++)
    {
            cout<<queue[y - 1]<<" ";
            y++;
    }
    system("pause");
    cout<<"add one more element in the queue and remove the first element"<<endl;
    cout<<"The main element of the queue = "<<queue[top - 1]<<endl;
    cout<<"The last element of the queue = "<<queue[last - 1]<<endl;
    queue[last] = top;
 
        cout<<"Queue has the form:"<<endl;
    for(int i = 1; i <= k; i++)
    {
            cout<<queue[y-5]<<" ";
            y++;
    }
 
    system("pause");
 
    cout<<"add one more element in the queue and remove the last element"<<endl;
    cout<<"The main element of the queue = "<<queue[top]<<endl;
    cout<<"The last element of the queue = "<<queue[last]<<endl;
    queue[top] = last+1;
 
    cout<<"Queue has the form:"<<endl;
    for(int i = 1; i <= k; i++)
    {
            cout<<queue[y - 5]<<" ";
            y++;
    }
    }   
    else
    {cout<<"Enter a number less than the maximum size of the array"<<endl;}
    system("pause");
}