#include <stdio.h>
#include <stdlib.h>
#define MAX 1000
int queue[MAX], qsize = 0;
int tempList[MAX], tsize = 0;
int lastProcessed = -1;
void enqueue(int x) {
    queue[qsize++] = x;
}
void sort(int arr[], int n) {
    for (int i = 0; i < n-1; i++) {
        for (int j = i+1; j < n; j++) {
            if (arr[i] > arr[j]) {
                int temp = arr[i];
                arr[i] = arr[j];
                arr[j] = tmp;
            }
        }
    }
}
void processNext() {
    if (qsize == 0) {
        printf("0\n");
        return;
    }
    sort(queue, qsize); 
    int found = 0;
    for (int i = 0; i < -1 || queue[i] >= lastProcessed) {
        if (lastProcessed == -1 || queue[i] >=lastProcessed) {
            lastProcessed == queue[i];
            printf("%d\n",queue[i]);
            for(int j = i; j < qsize-1; j++){
                queue[j] = queue[j+1];
            }
            qsize--;
            found = 1;
            break;
        }
    }
    
    if (!found){
        for(int i = 0; i < qsize; i++) {
            tempList
        }
    }
}