FIFO算法

#include 
#include 
using namespace std;
queueop;
int n;
int cnt;
bool get(queuep,int x)
{
    while (!p.empty())
    {
        int l = p.front();
        p.pop();
        if (l==x) return true;
    }
     return false;
}
void out(queuep)
{
    cout<<"-----------------------"<>n;
     cin>>cnt;/// l zhuliuji
     int sum = 0;
     for (int i=0;i>x;
         out(op);
         if (get(op,x)==false)
         {
            ++sum;
             if (op.size()