Queue

#include <iostream>
 
using namespace std;
 
struct data{
    int x,y;
    data(int x,int y):x(x),y(y){}
    data(){}
};
 
struct queue{
    data d[10010];
    int start,end,size;                 //st:시작점 ed:끝점
    queue(){
        start=end=size=0;
    }
    int sz(){
        return size;
    }
    void push(int x,int y){
        d[end++]=data(x,y);
        size++;
    }
    data pop(){
        start++;
        size--;
        return d[start-1];
    }
    void printQueue(){
        for(int i=start;i<end;i++){
            printf("%d %d\n" , d[i].x,d[i].y);
        }
    }
};
 
int main(){
    queue qu;
    qu.push(1, 2);
    qu.push(2, 3);
    qu.printQueue();
    return 0;
}

data형 d[]배열에 start,end 를 통해서 큐를 구현