#include <stdio.h>
#include <string.h>
#include <stdlib.h>

class Stack {
	int stack[5];
	int top;
	int size;
	
public:
	Stack() {
		top = -1;
		size = 5;
		for (int i=0; i<size; i++) stack[i] = 0;
	}
	
	void push(int elem) {
		if (top >= size-1){
			printf("스텍이 모두 찼습니다.\n");
			return;
		}
		top++;
		stack[top] = elem;
	}
	
	void pop() {
		if (top == -1) {
			printf("스텍이 모두 비어있습니다.\n");
			return;
		}
		printf("pop 결과: %d\n", stack[top]);
		top--;
	}
	
	void display() {
		printf("Stack: \n");
		
		if(top == -1){
			return;
		}
		
		for (int i=top; i>=0; i--){
			if (i == top){
				printf("top -> ");
				printf("[%d]\n", stack[i]);
				continue;
			}
			printf("       [%d]", stack[i]);
			printf("\n");
		}
	}
};

int main() {
	Stack s1;
	s1.push(1);
	s1.push(2);
	s1.push(4);
	s1.push(5);
	
	
	s1.display();
}