UVA-12100 Printer Queue

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cmath>

using namespace std;

int main ()
{
    int N;
    cin >> N;
    while(N--)
    {
        int n,m;
        cin >> n >> m;
        queue<int> q;
        int List[11];
        memset(List,0,sizeof(List));
        while(n--)
        {
            int tmp;
            cin >> tmp;
            if(m == 0)
            {
                q.push(-tmp);
                m --;
            }
            else
            {
                q.push(tmp);
                m --;
            }
            List[tmp] ++;
        }

        int time = 0;
        while(!q.empty())
        {
            int i;
            for(i = abs(q.front())+1;i <= 9;i ++)
            {
                if(List[i])
                {
                     int a = q.front();
                     q.pop();
                     q.push(a);
                     break;
                }
            }
            if(i==10)
            {
                List[abs(q.front())] --;
                if(q.front()<0)
                {
                    time ++;
                    break;
                }
                q.pop();
                time ++;
            }
        //    cout << q.front() << " ";
        }
        cout << time << endl;
    }
    return 0;
}