Stack implementation via dynamic array

stack_.cpp

#include <iostream>
#include <cstring>
using namespace std;


class stack {
	int top;
	int size;
	int *arr;

public:
	stack(int s) {
		top = -1;
		size = s;
		arr = new int[size];
	}

	void push(int i);
	int pop();
};


void stack::push(int i) {
	if(top==size-1) {
		cout<<"Overflow\n";
	}

	else {
		top++;
		arr[top] = i; 
	}
}


int stack::pop() {
	if(top==-1) {
		cout<<"Underflow\n";
		return 0;
	}

	else {
		int a = top;
		top--;	 
		return arr[a];
	}
}

int main() {
	stack s(3000);
	
	return 0;	
}